On the extremal combinatorics of the hamming space

We present new asymptotic bounds for problems in extremal set theory related to finding the maximum number of qualitatively 3-independent bipartitions of an n-set. We consider the space of all binary sequences of some fixed length n. As we select subsets of growing cardinality we see an increasing number of different “small configurations” necessarily emerge.