On the number of possible row and column sums of \(0,1\)-matrices (Q2500997)

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.