Combinatorics in the exterior algebra and the Bollob\'as Two Families Theorem

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 Erdos-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\'as, 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\'os, Tompkins, and Xiao on pairs of set systems satisfying both an intersection and a cross-intersection condition.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…