vol16_pp157-161. 119KB Jun 04 2011 12:05:56 AM
Teks penuh
Dokumen terkait
Several properties of scalar palindromic polynomials are derived, and together with properties of compound matrices, used to establish the Smith form of regular and singular
For such matrices this improves on a bound found in the work of Doerr [Linear discrepancy of basic totally unimodular matrices, The Electronic Journal of Combinatorics, 7:Research
The minimum rank problem is the problem of finding the smallest rank of a matrix in the set of symmetric matrices having the zero-nonzero pattern of off-diagonal entries described by
In the paper [6] (see also [7]) the author has derived a precise estimate for the Euclidean norm which is attained in the case of normal matrices. But that estimate requires bounds
This is a variant on the symmetric minimum rank problem for a simple graph , which asks for a determination of the minimum rank among all real symmetric matrices whose
An idea of the variety of possible distribution functions is provided by the class of matrices whose singular values satisfy.. 0 = s
Still in the Gaussian case, [13] derived upper bounds of large deviations type for the spectral measure of band matrices, including certain sample covariance matrices.. Her
CENTRAL LIMIT THEOREMS FOR THE PRODUCTS OF RANDOM MATRICES SAMPLED BY A RANDOM WALK.. FR´ ED´ ERIQUE DUHEILLE-BIENVEN
