On the Constraints of Some Balanced Arrays

In this paper, we obtain some combinatorial inequalities involving the parameters of a balanced array (B-array) \(T\) of strength four and with two levels. We discuss the usefulness of these inequalities in obtaining an upper bound for the number of constraints of \(T\), and briefly describe the importance of these arrays in the design of experiments as well as in combinatorics.