# Level Matrices

Research paper by George Seelinger, Papa Sissokho, Larry Spence, Charles Vanden Eynden

Indexed on: 22 Jan '14Published on: 22 Jan '14Published in: Mathematics - Combinatorics

#### Abstract

Let $n>1$ and $k>0$ be fixed integers. A matrix is said to be level if all its column sums are equal. A level matrix with $m$ rows is called reducible if we can delete $j$ rows, $0<j<m$, so that the remaining matrix is level. We ask if there is a minimum integer $\ell=\ell(n,k)$ such that for all $m>\ell$, any $m\times n$ level matrix with entries in $\{0,\ldots,k\}$ is reducible. It is known that $\ell(2,k)=2k-1$. In this paper, we establish the existence of $\ell(n,k)$ for $n\geq 3$ by giving upper and lower bounds for it. We then apply this result to bound the number of certain types of vector space multipartitions.