首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 171 毫秒
1.
Given a bounded set Ψ of n×n non-negative matrices, let ρ(Ψ) and μ(Ψ) denote the generalized spectral radius of Ψ and its max version, respectively. We show that
  相似文献   

2.
Let be the set of entrywise nonnegative n×n matrices. Denote by r(A) the spectral radius (Perron root) of . Characterization is obtained for maps such that r(f(A)+f(B))=r(A+B) for all . In particular, it is shown that such a map has the form
  相似文献   

3.
Let A be an n-by-n (n?2) matrix of the form
  相似文献   

4.
We show that if A is an n-by-n (n?3) matrix of the form
  相似文献   

5.
It is known that for any nonzero complex n×n matrices X and Y the quotient of Frobenius norms
  相似文献   

6.
Let T be an n×n matrix. The Davis-Wielandt shell of T is defined as the set
  相似文献   

7.
Let be a locally strongly convex hypersurface, given by the graph of a convex function xn+1=f(x1,…,xn) defined in a convex domain ΩRn. M is called a α-extremal hypersurface, if f is a solution of
  相似文献   

8.
Let φ be a positive linear functional on Mn(C) and f,g mutually conjugate in the sense of Young. In this note we show a necessary and sufficient condition for the inequality
  相似文献   

9.
The rank-k-numerical range of an n×n matrix A is defined as
  相似文献   

10.
Let A be an n×n complex matrix and c=(c1,c2,…,cn) a real n-tuple. The c-numerical range of A is defined as the set
  相似文献   

11.
A min-max theorem for complex symmetric matrices   总被引:1,自引:0,他引:1  
We optimize the form Re xtTx to obtain the singular values of a complex symmetric matrix T. We prove that for ,
  相似文献   

12.
We find lower bounds on the difference between the spectral radius λ1 and the average degree of an irregular graph G of order n and size e. In particular, we show that, if n ? 4, then
  相似文献   

13.
Let A be a commutative k-algebra over a field of k and Ξ a linear operator defined on A. We define a family of A-valued invariants Ψ for finite rooted forests by a recurrent algorithm using the operator Ξ and show that the invariant Ψ distinguishes rooted forests if (and only if) it distinguishes rooted trees T, and if (and only if) it is finer than the quantity α(T)=|Aut(T)| of rooted trees T. We also consider the generating function with , where is the set of rooted trees with n vertices. We show that the generating function U(q) satisfies the equation . Consequently, we get a recurrent formula for Un (n?1), namely, U1=Ξ(1) and Un=ΞSn−1(U1,U2,…,Un−1) for any n?2, where are the elementary Schur polynomials. We also show that the (strict) order polynomials and two well-known quasi-symmetric function invariants of rooted forests are in the family of invariants Ψ and derive some consequences about these well-known invariants from our general results on Ψ. Finally, we generalize the invariant Ψ to labeled planar forests and discuss its certain relations with the Hopf algebra in Foissy (Bull. Sci. Math. 126 (2002) 193) spanned by labeled planar forests.  相似文献   

14.
Let rk(n) denote the number of representations of an integer n as a sum of k squares. We prove that for odd primes p,
  相似文献   

15.
Traditionally an inverse eigenvalue problem is about reconstructing a matrix from a given spectral data. In this work we study the set of real matrices A of order n such that the linear complementarity system
  相似文献   

16.
Let V be a vector space over a field or skew field F, and let U be its subspace. We study the canonical form problem for bilinear or sesquilinear forms
  相似文献   

17.
Let a,b>0 and let ZMn(R) such that Z lies into the operator ball of diameter [aI,bI]. Then for all positive definite AMn(R),
  相似文献   

18.
Let An,nN, be a sequence of k×k matrices which converge to a matrix A as n. It is shown that if xn,nN, is a sequence of nonnegative nonzero vectors such that
  相似文献   

19.
The nth Delannoy number and the nth Schröder number given by
  相似文献   

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

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