On the number of possible row and column sums of \(0,1\)-matrices (Q2500997)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5050796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of possible row and column sums of \(0,1\)-matrices |
scientific article; zbMATH DE number 5050796 |
Statements
On the number of possible row and column sums of \(0,1\)-matrices (English)
0 references
30 August 2006
0 references
Summary: For \(n\) a positive integer, we show that the number of \(2n\)-tuples of integers that are the row and column sums of some \(n\times n\) matrix with entries in \(\{0,1\}\) is evenly divisible by \(n+1\). This confirms a conjecture of \textit{J. Benton, R. Snow, and N. Wallach} [Linear Algebra Appl. 412, 30--38 (2006; Zbl 1076.05015)]. We also consider a \(q\)-analogue for \(m\times n\) matrices. We give an efficient recursion formula for this analogue. We prove a divisibility result in this context that implies the \(n+1\) divisibility result.
0 references
divisibility result
0 references
0.9492542
0 references
0.9364493
0 references
0.9239195
0 references
0.9201261
0 references
0.91669184
0 references
0.9161395
0 references
0.90757877
0 references
0.90533054
0 references
