Combinatorics in the exterior algebra and the Bollobás Two Families Theorem (1907.06019v2)
Abstract: We investigate the combinatorial structure of subspaces of the exterior algebra of a finite-dimensional real vector space, working in parallel with the extremal combinatorics of hypergraphs. Using initial monomials, projections of the underlying vector space onto subspaces, and the interior product, we find analogues of local and global LYM inequalities, the Erd\H{o}s-Ko-Rado theorem, and the Ahlswede-Khachatrian bound for $t$-intersecting hypergraphs. Using these tools, we prove a new extension of the Two Families Theorem of Bollob\'{a}s, giving a weighted bound for subspace configurations satisfying a skew cross-intersection condition. We also verify a recent conjecture of Gerbner, Keszegh, Methuku, Abhishek, Nagy, Patk\'{o}s, Tompkins, and Xiao on pairs of set systems satisfying both an intersection and a cross-intersection condition.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.