首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
The purpose of this paper is to characterize and interrelate various degrees of stability and semipositivity for real square matrices having nonpositive off-diagonal entries. The major classes considered are the sets of diagonally stable, stable, and semipositive matrices, denoted respectively by A, L, and S. The conditions defining these classes are weakened, and the resulting classes are examined. Their relationship to the classes of real matrices P and P0, whose off-diagonal entries are nonpositive and whose principal minors are respectively all positive and all nonnegative, is also included.  相似文献   

2.
Three main results are obtained: (1) If D is an atomic maximal Abelian subalgebra of B(H), P is the projection of B(H) onto D and h is a complex homomorphism on D, then h ° P is a pure state on B(H). (2) If {Pn} is a sequence of mutually orthogonal projections with rank(Pn) = n and ∑ Pn = I, P is the projection of B(H) onto {Pn}″ given by P(T)=∑tracen(T)Pn and h is a homomorphism on {Pn}″ such that h(Pn) = 0 for all n then h ° P induces a type II factor representation of the Calkin algebra. (3) If M is a nonatomic maximal Abelian subalgebra of B(H) then there is an atomic maximal Abelian subalgebra D of B(H) and a large family {Φα} of 1-homomorphisms from D onto M such that for each α, Φα ° P is an extreme point in the set of projections from B(H) onto M. (Here P denotes the projection of B(H) onto D.)  相似文献   

3.
4.
Let k be a positive square free integer, N(?k)12 the ring of algebraic integers in Q(?k)12 and S the unit sphere in Cn, complex n-space. If A1,…, An are n linearly independent points of Cn then L = {u1Au + … + unAn} with ur ∈ N(?k)12 is called a k-lattice. The determinant of L is denoted by d(L). If L is a covering lattice for S, then θ(S, L) = V(S)d(L) is the covering density. L is called locally (absolutely) extreme if θ(S, L) is a local (absolute) minimum. In this paper we determine unique classes of extreme lattices for k = 1 and k = 3.  相似文献   

5.
We characterize real indecomposable quasi-Jacobi matrices of class D, i.e., those which satisfy the Lyapunov equation PA + AP = ?Q with P diagonal and both P and Q positive definite. The subclass D2 (of class D) when also Q is diagonal is also characterized in the case of general indecomposable real matrices.  相似文献   

6.
Given a commuting pair A1, A2 of abelian C1 subalgebras of the Calkin algebra, we look for a commuting pair B1,B2 of C1 subalgebras of B(H) which project onto A1 and A2. We do not insist that Bi, be abelian, so Bi, may contain nontrivial compact operators. If X is the joint spectrum σ(A1, A2), it is shown that the existence of a pair B1, B2 depends only on the element τ in Ext(X) determined by A1, A2. The set L(X) of those τ in Ext(X) which “lift” in this sense is shown to be a subgroup of Ext(X) when Ext(X) is Hausdorff, and also when Ai are singly generated. In this latter case, L(X) can be explicitly calculated for large classes of joint spectra. These results are applied to lift certain pairs of commuting elements of the Calkin algebra to pairs of commuting operators.  相似文献   

7.
Some continuity properties of the averaging projection P onto the set of Hankel matrices are investigated. It is proved that this projection is of weak type (1, 1) which means that for any nuclear operator T the s-numbers of PT satisfy Sn(PT) ? const(n + 1). As a consequence it is obtained that P maps the Matsaev ideal Gω = {T:∑n?0Sn(T)(2n + 1)?1 < ∞} into the set of compact operators.  相似文献   

8.
In 1941, Dushnik and Miller introduced the concept of the dimension of a poset (X, P) as the minimum number of linear extensions of P whose intersection is exactly P. Although Dilworth has given a formula for the dimension of distributive lattices, the general problem of determining the dimension of a poset is quite difficult. An equally difficult problem is to classify those posets which are dimension irreducible, i.e., those posets for which the removal of any point lowers the dimension. In this paper, we construct for each n≥3, k≥0, a poset, called a crown and denoted Skn, for which the dimension is given by the formula 2?(n+k)(k+2). Furthermore, for each t≥3, we show that there are infinitely many crowns which are irreducible and have dimension t. We then demonstrate a method of combining a collection of irreducible crowns to form an irreducible poset whose dimension is the sum of the crowns in the collection. Finally, we construct some infinite crowns possessing combinatorial properties similar to finite crowns.  相似文献   

9.
This paper investigates the structure of the H-classes in the semigroup Nn of nonnegative matrices. We obtain two sets of equivalent conditions for any two matrices A,B to satisfy AHB in Nn. We establish a one-to-one and onto correspondence between the H-class HA and the group WA0 of the greatest cone independent submatrix A0 of A. We find WA0 can be made up from the groups of the connective submatrices of A0.  相似文献   

10.
11.
Let P be the set of all n × n real matrices which have a positive determinant. We show here that at least 2n ? 1 matrices are needed to “see” each matrix in P. Also, any finite subset of P can be “seen” from a class of at most 2n ? 1 matrices in P.  相似文献   

12.
Let F=GF(q) denote the finite field of order q, and let ?(x)?F[x]. Then f(x) defines, via substitution, a function from Fn×n, the n×n matrices over F, to itself. Any function ?:Fn×n → Fn×n which can be represented by a polynomialf(x)?F[x] is called a scalar polynomial function on Fn×n. After first determining the number of scalar polynomial functions on Fn×n, the authors find necessary and sufficient conditions on a polynomial ?(x) ? F[x] in order that it defines a permutation of (i) Dn, the diagonalizable matrices in Fn×n, (ii)Rn, the matrices in Fn×n all of whose roots are in F, and (iii) the matric ring Fn×n itself. The results for (i) and (ii) are valid for an arbitrary field F.  相似文献   

13.
The concepts of matrix monotonicity, generalized inverse-positivity and splittings are investigated and are used to characterize the class of all M-matrices A, extending the well-known property that A?1?0 whenever A is nonsingular. These conditions are grouped into classes in order to identify those that are equivalent for arbitrary real matrices A. It is shown how the nonnegativity of a generalized left inverse of A plays a fundamental role in such characterizations, thereby extending recent work by one of the authors, by Meyer and Stadelmaier and by Rothblum. In addition, new characterizations are provided for the class of M-matrices with “property c”; that is, matrices A having a representation A=sI?B, s>0, B?0, where the powers of (1s)B converge. Applications of these results to the study of iterative methods for solving arbitrary systems of linear equations are given elsewhere.  相似文献   

14.
A simple graph with n vertices is called Pi-connected if any two distinct vertices are connected by an elementary path of length i. In this paper, lower bounds of the number of edges in graphs that are both P2- and Pi-connected are obtained. Namely if i?12(n+1), then |E(G)|?((4i?5)/(2i?2))(n?1), and if i > 12(n+ 1), then |E(G)|?2(n?1) apart from one exeptional graph. Furthermore, extremal graphs are determined in the former.  相似文献   

15.
The cone CPn,q of completely positive linear transformations from Mn(C)=Mn to Mq is shown to be isometrically isomorphic to Pnq, the cone of nq by nq positive semidefinite matrices. Generalizations of scalar and matrix results to CPn, q?HPn, q? L(Mn ,Mq) (where HPn,q represents the hermitian-preserving linear transformations) are discussed. Relationships among the completely positives, the set of positive semidefinite preservers π(Pn), and its dual π(Mn)1 are given. Left and right facial ideals of CP are characterized. Properties of the joint angular field of values of a finite sequence of hermitian matrices H1,…, Hm are studied, leading to a characterization of π(Pq, Pn).  相似文献   

16.
Tabloïdes     
A tabloïde is composed of two finite sets, E (the set of the rows) and F (the set of the columns), and of a function f: P(E) × P(F) → N, which is a Whitney's rank in its two variables. There are tabloids associated to matrices, to bipartite graphs and to ordinary graphs respectively in relation to linear rank, matchings and gammoids. Some of the properties of matrices can be generalized to tabloids (transposition, direct sum, inverse, product…). The properties of bipartite graphs which consists in “transmission” of matroids by matchings is used to define a class of tabloids (which strictly contains those which are associated to matrices). Finally, the problem of the representation of a tabloid on a field is studied.  相似文献   

17.
This paper considers the conjecture that given a real nonsingular matrix A, there exist a real diagonal matrix Λ with ¦λiiλ = 1 and a permutation matrix P such that (ΛPA) is positive stable. The conjecture is shown to be true for matrices of order 3 or less and may not be true for higher order matrices. A counterexample is presented in terms of a matrix of order 65. In showing this, an interesting matrix Ml of order 2l = 64, which satisfies the matrix equation 2l-1(Ml + MTl), has been used. The stability analysis is done by first decomposing the nonsingular matrix into its polar form. Some interesting results are presented in the study of eigenvalues of a product of orthogonal matrices. A simple function is derived in terms of these orthogonal matrices, which traces a hysteresis loop.  相似文献   

18.
Let Ωn denote the set of all Hadamard matrices of order n. For H ? Ωn, define the weight of H to be the number of 1's in H and is denoted by w(H). For a subset Γ ? Ωn, define the maximal weight of Γ as w(Γ) = max{w(H) | H?Γ}. Two Hadamard matrices are equivalent if one of them can be transformed to the other by permutation and negation of rows and columns, and the equivalence class containing H is denoted by [H]. In this paper, we shall derive lower bounds for w([H]), which are best possible for n ? 20. We shall also determine the exact value of w(Ω32).  相似文献   

19.
An algorithm parametrized by sequences of matrices {Ai} and {Bi} is presented. The concept of wastefulness of the algorithm on a class b of constrained optimization problems is introduced. Then it is proved that the algorithm is nonwasteful on b if and only if the matrices Ai are positive multiples of the identity matrix and the matrices Bi are positive semidefinite.  相似文献   

20.
In a separable Hilbert space a certain class of pairs of operators (P, Q) satisfying the Born-Heisenberg commutation relation [P, Q] = ?i Id on a dense domain Ω is investigated. This class is essentially defined by requiring Q bounded and self-adjoint, P symmetric and PΩ ? Ω, QΩ ? Ω. We show that Q is absolutely continuous and that P can be thought of as a first order differential operator. The class considered contains the pair “angle ?” and “angular momentum Lz.” It is expected that the methods of this paper can be applied to more general classes of operators (P, Q) including the Schrödinger case.  相似文献   

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

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