A generalization of Ryser's theorem on term rank
β Scribed by Kevin McDougal
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 233 KB
- Volume
- 170
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
In his work on classes of (0, 1 )-matrices with given row and column sum vectors, Herbert Ryser proved that the maximum term rank possible in a normalized class, p, can be realized by a matrix having p (independent) l's in positions (1,p),(2,p-1) ..... (p, 1). We study the positions occupied by sets of t ~<p independent l's.
π SIMILAR VOLUMES
A famous theorem of Ryser asserts that a v x v zero-one matrix A satisfying AA r --(k -k)I + aJ with k ~ k must satisfy k + (v -1)k = k 2 and ArA (k -k)I + A J; such a matrix A is called the incidence matrix of a symmetric block design. We present a new, e/ementary proof of Ryser's theorem and give
The work is devoted to the calculation of asymptotic value of the choice number of the complete r-partite graph K m \* r = K m,. ..,m with equal part size m. We obtained the asymptotics in the case ln r = o(ln m). The proof generalizes the classical result of A.L. Rubin for the case r = 2.