On The Constraints of Some Combinatorial Arrays

In this paper, we obtain a set of inequalities which are necessary conditions for the existence of balanced arrays of strength five, having \( m \) rows (constraints), and with two symbols. We discuss the use of these inequalities to obtain an upper bound on \( m \), and present some illustrative examples.