Level Matrices

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

e l l = e l l (n, k)

such that for all

m > e l l

, any

m i m e s n

level matrix with entries in

0, l d o t s, k

is reducible. It is known that

e l l (2, k) = 2 k - 1

. In this paper, we establish the existence of

e l l (n, k)

for

n g e q 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.

This page was built for publication: Level Matrices