首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 359 毫秒
1.
Let A(R, S) denote the class of all m×n matrices of 0's and 1's having row sum vector R and column sum vector S. The interchange graph G(R, S) is the graph where the vertices are the matrices in A(R, S) and where two matrices are joined by an edge provided they differ by an interchange. We characterize those A(R, S) for which the graph G(R, S) has diameter at most 2 and those A(R, S) for which G(R, S) is bipartite.  相似文献   

2.
Let R = (r1,…, rm) and S = (s1,…, sn) be nonnegative integral vectors, and let U(R, S) denote the class of all m × n matrices of 0's and 1's having row sum vector R and column sum vector S. An invariant position of U(R, S) is a position whose entry is the same for all matrices in U(R, S). The interchange graph G(R, S) is the graph where the vertices are the matrices in U(R, S) and where two matrices are joined by an edge provided they differ by an interchange. We prove that when 1 ≤ rin ? 1 (i = 1,…, m) and 1 ≤ sjm ? 1 (j = 1,…, n), G(R, S) is prime if and only if U(R, S) has no invariant positions.  相似文献   

3.
Let %plane1D;518;2(R,S) be the class of all (0, 1, 2)-matrices with a prescribed row sum vector R and column sum vector S. A (0, 1,2)-matrix in %plane1D;518;2(R,S) is defined to be parsimonious provided no (0, 1, 2)-matrix with the same row and column sum vectors has fewer positive entries. In a parsimonious (0, 1, 2)-matrix A there are severe restrictions on the (0, 1)-matrix A(1) which records the positions of the 1's in A. Brualdi and Michael obtained some necessary arithmetic conditions for a set of matrices to serve simultaneously as the 1-pattern matrices for parsimonious matrices in a given class. In this paper, we provide a direct construction that proves that these conditions are also sufficient.  相似文献   

4.
Let φ and ψ be any norms on Rm and Rn respectively. We study a subgradient method for computing the associated bound norm Sφψ(A) = sup{φ(Ax), ψ(x)?1} (a nonconvex optimization problem). It is proved that homodual method converges when one of the norms φ and ψ is polyhedral.  相似文献   

5.
Let Km be the complete graph of order m. We prove that the cartesian sum Km+Kn can be decomposed into 12(m+n?2) hamiltonian cycles if m+n is even and into 12(m+n?3) hamiltonian cycles and a perfect matching if m+n is odd.  相似文献   

6.
If m and n are positive integers then let S(m, n) denote the linear space over R whose elements are the real-valued symmetric n-linear functions on Em with operations defined in the usual way. If U is a function from some sphere S in Em to R then let U(i)(x) denote the ith Frechet derivative of U at x. In general U(i)(x)∈S(m,i). In the paper “An Iterative Method for Solving Nonlinear Partial Differential Equations” [Advances in Math. 19 (1976), 245–265] Neuberger presents an iterative procedure for solving a partial differential equation of the form
AUn(x)=F(x, U(x), U′(x),…,Uk(x))
, where k > n, U is the unknown from some sphere in Em to R, A is a linear functional on S(m, n), and F is analytic. The defect in the theory presented there was that in order to prove that the iterates converged to a solution U the condition k ? n2 was needed. In this paper an iteration procedure that is a slight variation on Neuberger's procedure is considered. Although the condition k ? n2 cannot as yet be eliminated, it is shown that in a broad class of cases depending upon the nature of the functional A the restriction k ? n2 may be replaced by the restriction k ? 3n4.  相似文献   

7.
Let D be the group of orientation-preserving diffeomorphisms of the circle S1. Then D is Fréchet Lie group with Lie algebra (δ)R the smooth real vector fields on S1. Let δR be the subalgebra of real vector fields with finite Fourier series. It is proved that every infinitesimally unitary projective positive-energy representation of δR integrates to a continuous projective unitary representation of D. This result was conjectured by V. Kac.  相似文献   

8.
Let F1(Rn) denote the Fourier algebra on Rn, and D(Rn) the space of test functions on Rn. A closed subset E of Rn is said to be of spectral synthesis if the only closed ideal J in F1(Rn) which has E as its hull
h(J)={x ? Rn:f(x)=0 for all f ? J}
is the ideal
k(E)={f?F1(Rn):f(E)=0}
. We consider sufficiently regular compact subsets of smooth submanifolds of Rn with constant relative nullity. For such sets E we give an estimate of the degree of nilpotency of the algebra (k(E)∩D(Rn))?j(E), where j(E) denotes the smallest closed ideal in F1(Rn) with hull E. Especially in the case of hypersurfaces this estimate turns out to be exact. Moreover for this case we prove that k(E)∩D(Rn) is dense in k(E). Together this solves the synthesis problem for such sets.  相似文献   

9.
Let A be a subalgebra of the full matrix algebra Mn(F), and suppose JA, where J is the Jordan block corresponding to xn. Let S be a set of generators of A. It is shown that the graph of S determines whether A is the full matrix algebra Mn(F).  相似文献   

10.
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.  相似文献   

11.
Let Cn×n and Hn denote respectively the space of n×n complex matrices and the real space of n×n hermitian matrices. Let p,q,n be positive integers such that p?q?n. For A?Cn×n, the (p,q)-numerical range of A is the set
Wp,q(A)={trCp(JqUAU1):U unitary}
, where Cp(X) is the pth compound matrix of X, and Jq is the matrix Iq?On-q. Let L denote Hn or Cn×n. The problem of determining all linear operators T: LL such that
Wp,q(T(A))=Wp,q(A) for all A?L
is treated in this paper.  相似文献   

12.
Let Fm×n (m?n) denote the linear space of all m × n complex or real matrices according as F=C or R. Let c=(c1,…,cm)≠0 be such that c1???cm?0. The c-spectral norm of a matrix A?Fm×n is the quantity
6A6ci=Imciσi(A)
. where σ1(A)???σm(A) are the singular values of A. Let d=(d1,…,dm)≠0, where d1???dm?0. We consider the linear isometries between the normed spaces (Fn,∥·∥c) and (Fn,∥·∥d), and prove that they are dual transformations of the linear operators which map L(d) onto L(c), where
L(c)= {X?Fm×n:X has singular values c1,…,cm}
.  相似文献   

13.
§1IntroductionLetGbeaconnectedgraphwithvertex-setV(G)andedge-setE(G).Denotebye=(x,y)theedgejoiningtheverticesxandyofG.Am-cliq...  相似文献   

14.
Let (Ω, ∑, μ) be a finite measure space and X a separable Banach space. We characterize the linear isometries of Lp(Ω, X) onto itself for 1 ? p < ∞, p ≠ 2 under the condition that X is not the lp-direct sum of two nonzero spaces (for the same p). It is shown that T is such an isometry if and only if (Tf)(·) = S(·)h(·)(Φ(f))(·), where Φ is a set isomorphism of ∑ onto itself, S is a strongly measurable operator-valued map such that S(t) is a.e. an isometry of X onto itself, and h is a scalar function which is related to Φ. It is further shown that for a big class of measure spaces (perhaps all nontrivial ones) the condition on X is also a necessary condition for the above conclusion to hold. In the case when X is a Hilbert space the injective isometries of Lp(Ω, X) are also characterized. They have the same form as above, except that Φ and S(t) are not necessarily onto.  相似文献   

15.
Let E be a Banach space. Let ξ be a sequence of which goes to zero. Let X be a centered E-valued random variable, which is bounded. Let Sn be the sum of n independent copies of X. Assume that whenever X satisfies the CLT, we have.
Supt ?R |P(6Sn√n | ? t) ? μ ({x;6x6 ?})| ? ξn
where μ is the (Gaussian) limit of the laws of Sn. Then E is type 2.  相似文献   

16.
Let T be a linear transformation on the set of m × n matrices with entries in an algebraically closed field. If T maps the set of all matrices whose rank is k into itself, and ifn?3k2, then the rank of A is the rank of T(A) for every m × n matrix.  相似文献   

17.
Let B(H) be the bounded operators on a Hilbert space H. A linear subspace R ? B(H) is said to be an operator system if 1 ?R and R is self-adjoint. Consider the category b of operator systems and completely positive linear maps. R ∈ C is said to be injective if given A ? B, A, B ∈ C, each map AR extends to B. Then each injective operator system is isomorphic to a conditionally complete C1-algebra. Injective von Neumann algebras R are characterized by any one of the following: (1) a relative interpolation property, (2) a finite “projectivity” property, (3) letting Mm = B(Cm), each map RN ? Mm has approximate factorizations RMnN, (4) letting K be the orthogonal complement of an operator system N ? Mm, each map MmK → R has approximate factorizations MmK → Mn → R. Analogous characterizations are found for certain classes of C1-algebras.  相似文献   

18.
Let C be a closed convex subset of a uniformly smooth Banach space. Let S(t) : CC be a semigroup of type ω. Then the generator A0 of S(t) has a dense domain in C. Moreover there is is an operator A such that: (i) A0 ? A and D(A) = C, (ii) A + gwI accretive, (iii) R(I + λA) ? C for λ > 0 and ωλ < 1, (iv) S(t)x = limn → ∞(I + (tn)A)?nx for every x?C.  相似文献   

19.
In this paper we show the existence and uniqueness of a natural isomorphism øjα of Kj(A) with Kj+1(A ?αR), j ? Z/2 where (A, R, α) is a C1 dynamical R-system, K is the functor of topological K theory and A ?αR is the crossed product of A by the action of R. The Pimsner-Voiculescu exact sequence is obtained as a corollary. We show that given an α-invariant trace τ on A, with dual trace \?gt, one has \?gtø1α[u] = (12iπ) τ(δ(u)u1) for any unitary u in the domain of the derivation δ of A associated to the action α. Finally, we show that the crossed product of C(S3) (continuous functions on the 3 sphere) by a minimal diffeomorphism is a simple C1 algebra with no nontrivial idempotent.  相似文献   

20.
We are interested in the parallel computation of a linear mapping of n real variables by a network of computers with restricted means of communication between them and without any common memory. Let Mn×n(R) denote the algebra of n×n real matrices, and let G be the graph associated with a binary, reflexive and symmetric relation R over {1,2, …,n}. We define
AR = {A?Mn×n(R):aij≠ 0 implies iRj}
A matrix M∈Mn×n(R) is said to be realizable on G if it can be expressed as a product of elements of AR. Therefore, every matrix of Mn×n(R) is realizable on G if and only if AR generates Mn×n(R). We show that AR generates M n×n(R) if and only if G is connected.  相似文献   

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

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