Octopuses in the Boolean cube: families with pairwise small intersections, part II
Andrey Kupavskii, Fedor Noskov

TL;DR
This paper investigates the maximum product of sizes of multiple families of subsets with limited pairwise intersections within the Boolean cube, providing new structural insights into extremal configurations.
Contribution
It establishes a strong structural characterization of extremal families of subsets with bounded intersections, extending previous asymptotic results to detailed structural understanding.
Findings
Derived a structural description of extremal families
Extended asymptotic results to explicit structural results
Connected combinatorial intersection problems to polytope theory
Abstract
The problem we consider originally arises from 2-level polytope theory. This class of polytopes generalizes a number of other polytope families. One of the important questions in this filed can be formulated as follows: is it true for a -dimensional 2-level polytope that the product of the number of its vertices and the number of its dimensional facets is bounded by ? Recently, Kupavskii and Weltge~\cite{Kupavskii2020} settled this question in positive. A key element in their proof is a more general result for families of vectors in such that the scalar product between any two vectors from different families is either or . Peter Frankl noted that, when restricted to the Boolean cube, the solution boils down to an elegant application of the Harris--Kleitman correlation inequality. Meanwhile, this problem becomes much more sophisticated when we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Mathematical Approximation and Integration · Limits and Structures in Graph Theory
