Graph explorer

Maximal unbalanced families

A family of subsets of the set {1,2,...,n} is said to be unbalanced if the convex hull of its characteristic vectors misses the diagonal in the n-cube.The purpose of this article is to develop the combinatorics of maximal unbalanced families. Specifically, we will prove lower and upper bounds on the number of maximal unbalanced families of subsets of an n-element set -- both bounds are of the form 2^{C n^2} for some C > 0. These families correspond to the chambers of a hyperplane arrangement, the restricted all-subset arrangement, that has arisen in various forms in physics, economics and psychometrics. In particular, our bounds answer a question posed in thermal field theory concerning the order of the number of chambers of this arrangement.