首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 468 毫秒
1.
Let L be a distributive lattice characterized by a ternary operation (, ,), where (a,b,c)=(ab)(bc)(ac)=(ab)(ac)(bc), a,b,cL. The note considers convex sublattices of L, called generalized ideals of L generated by the operation (, ,). Some remarks have been stated about the graph of a distributive lattice.  相似文献   

2.
3.
4.
Let be a group of *-automorphisms on the algebra of bounded linear operators on a complex Hilbert space H. Then the strongly closed convex hull of the orbit of any compact operator under consists of compact operators. The same is true if one replaces compact by nuclear, Hilbert-Schmidt or positive Fredholm. We further discuss these results in the framework of the noncommutative mean ergodic theorem of KOVACS and SZ#x00FC;CS and formulate an analogous theorem for the algebra of compact operators on a complex Hilbert space.

Gefördert von der Deutschen Forschungsgemeinschaft im Rahmen des Forschungsvorhabens Ko 506/1.  相似文献   

5.
6.
We consider hypergroups associated with Jacobi functions () (x), (–1/2). We prove the existence of a dual convolution structure on [0,+[i(]0,s 0]{{) =++1,s 0=min(,–+1). Next we establish a Lévy-Khintchine type formula which permits to characterize the semigroup and the infinitely divisible probabilities associated with this dual convolution, finally we prove a central limit theorem.  相似文献   

7.
A quasilinear equation u -x·u/2+f(u)=0 is studied, wheref(u)=–u+u , > 0, 0<. <1, >1 andx R n. The equation arises from the study of blow-up self-similar solutions of the heat equation t =+. We prove the existence and non-existence of ground state for various combination of , and . In particular, we prove that when / < forn=1,2 or / < (n + 2) /(n – 2) forn 3 there exists no non-constant positive radial self-similar solution of the parabolic equation, but for many cases where / > (n + 2)/(n – 2) there exists an infinite number of non-constant positive radial self-similar solutions.  相似文献   

8.
Summary Let denote the class of infinite product probability measures = 1× 2× defined on an infinite product of replications of a given measurable space (X, A), and let denote the subset of for which (A) =0 or 1 for each permutation invariant event A. Previous works by Hewitt and Savage, Horn and Schach, Blum and Pathak, and Sendler (referenced in the paper) discuss very restrictive sufficient conditions under which a given member , of belongs to . In the present paper, the class is shown to possess several closure properties. E.g., if and 0 n for some n 1, then 0× 1× 2×.... While the current results do not permit a complete characterization of they demonstrate conclusively that is a much larger subset of than previous results indicated. The interesting special case X={0,1} is discussed in detail.Research supported by the National Science Foundation under grant No. MCS75-07556  相似文献   

9.
The following theorem will be proved: THEOREM. Let (P,) be a linear space with dimension dim(P,) 2, such that each line contains at least three points. Let further Aut(P,) be a two — transitive group of collineations on the point set P, such that every automorphism fixing one flag (p,L), fixes all lines through p. Then (P,) is a desarguesian affine space and contains the whole group of dilatations of (P,). Moreover one can define an addition and a multiplication on the point set, such that (P,+,-) is a nearfield, the line joining the neutral elements is a normal subfield and consists of the affine transformations x a + mx, m 0 and= (K).

Herrn Professor Dr. Helmut Karzel zum 60. Geburtstag  相似文献   

10.
, (1). 3, , ()=, (8) (16). [1], . (28) (31) ( 5), - (. [3]).

The author thanks Professor M.Arató for having pointed out this problem, and for his valuable suggestions.  相似文献   

11.
. , , –1<<0. .

The present work was written on the basis of two earlier works received byAnalysis Mathematica on January 16, 1979, and July 20, 1979.  相似文献   

12.
We study the lower semicontinuous envelope in Lp(), F, of a functional F of the form F(u)=A uudx where A=A(x) is not strictly elliptic and not bounded. We prove that F; may also be written as F;(u)= Buudx with B=AP A for a matrix P which is the matrix of an orthogonal projection. In the one-dimensional case, we characterize the domain of F and we explicit the matrix P.  相似文献   

13.
Let M be the complete module of a purely real algebraic field of degree n 3, let be a lattice in this module, and let F(X) be its form. We use to denote any lattice for which we have = , where is a nondiagonal matrix for which – I . With each lattice we can associate a factorizable formF (X) in a natural manner. We denote the complete set of forms corresponding to the set {} by {F (X)}. It is proved that for any > 0 there exists an > 0 such that for eachF (X) {F } we have |F (X0)| for some integer vector X0 0.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 185, pp. 5–12, 1990.In conclusion, the author would like to express his deep gratitude to B. F. Skubenko for stating the problem and for his constant attention.  相似文献   

14.
In the power setP(E) of a setE, the sets of a fixed finite cardinalityk form across-cut, that is, a maximal unordered setC such that ifX, Y E satisfyXY, X someX inC, andY someY inC, thenXZY for someZ inC. ForE=, 1, and 2, it is shown with the aid of the continuum hypothesis thatP(E) has cross-cuts consisting of infinite sets with infinite complements, and somewhat stronger results are proved for and 1.The work reported here has been partially supported by NSERC Grant No. A8054.  相似文献   

15.
Any nonsingular linear transformation : GF(qs) GF(qs) can be used to treat a linear cyclic code of wordlength v over GF(qs) as a linear code () of Wordlength sv over GF(q). This paper determines those linear cyclic codes and transformations for which the resulting linear code () is also cyclic.  相似文献   

16.
On affine scaling algorithms for nonconvex quadratic programming   总被引:8,自引:0,他引:8  
We investigate the use of interior algorithms, especially the affine-scaling algorithm, to solve nonconvex — indefinite or negative definite — quadratic programming (QP) problems. Although the nonconvex QP with a polytope constraint is a hard problem, we show that the problem with an ellipsoidal constraint is easy. When the hard QP is solved by successively solving the easy QP, the sequence of points monotonically converge to a feasible point satisfying both the first and the second order optimality conditions.Research supported in part by NSF Grant DDM-8922636 and the College Summer Grant, College of Business Administration, The University of Iowa.  相似文献   

17.
In this paper we consider the equation y +q(t)y + p(t)h(y)=0, where p, q are real valued continuous functions on [0, ) such that q(t) 0, p(t) 0 and h(y) is continuous in (–, ) such that h(y)y > 0 for y 0. We obtain sufficient conditions for solutions of the considered equation to be nonoscillatory. Furthermore, the asymptotic behaviour of these nonoscillatory solutions is studied.  相似文献   

18.
Inversion formulas for infinite generalized Toeplitz matrices   总被引:3,自引:0,他引:3  
Inversion formulas are obtained for a certain class of infinite matrices that possess displacement structure similar to that of finite block Toeplitz matrices. Consequences are symmetric inversion formulas for matrix-valued singular integral operators and infinite Toeplitz plus Hankel matrices.  相似文献   

19.
We correct the proof of the log-free hybrid zero-density estimate given in On the Exceptional Set for Goldbachs Problem in Short Intervals, Monatsh Math 132: 49–65.  相似文献   

20.
Let I,I be the minor of a matrix which corresponds to row set I and column set I. We give a characterization of the inequalities of the form I,I K,K J,J L,L which hold for all totally nonnegative matrices. This generalizes a recent result of Fallat, Gekhtman, and Johnson.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号