Remarks on a matrix theorem arising in statistics
โ Scribed by Olga Todd-Taussky
- Publisher
- Springer Vienna
- Year
- 1966
- Tongue
- English
- Weight
- 117 KB
- Volume
- 70
- Category
- Article
- ISSN
- 0026-9255
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Recently the following theorem in combinatorial group theory has been proved: Let G be a finite abelian group and let A be a sequence of members of G such that |A| |G| +D(G)&1, where D(G) is the Davenport constant of G. Then A contains a subsequence B such that |B|= |G| and b # B b=0. We shall prese
The rigidity of a matrix is defined to be the number of entries in the matrix that have to be changed in order to reduce its rank below a certain value. Using a simple combinatorial lemma, we show that one must alter at least c( n\*/r) log( n/r) entries of an (n x n)-Cauchy matrix to reduce its rank