Combinatorics in the exterior algebra and the Bollobás two families theorem

DOI10.1112/JLMS.12484zbMATH Open1483.05193OpenAlexW3181654275MaRDI QIDQ5034136FDOQ5034136

Authors: Elizabeth L. Wilmer, Alex Scott 

Publication date: 24 February 2022

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

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 ErdH{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.

Full work available at URL: https://arxiv.org/abs/1907.06019

Recommendations

• Bollobás-type theorems for hemi-bundled two families
• Erdős-Ko-Rado and Hilton-Milner theorems for two-forms
• A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets
• On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families
• Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families

zbMATH Keywords

Erdős-Ko-Rado theoremAhlswede-Khachatrian bound

Mathematics Subject Classification ID

Extremal set theory (05D05) Exterior algebra, Grassmann algebras (15A75) Configurations and arrangements of linear subspaces (14N20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Sperner theorem on unrelated chains of subsets
• A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets
• A new generalization of the Erdős-Ko-Rado theorem
• A remark on the paper ``Properties of intersecting families of ordered sets by O. Einstein
• A short proof of Sperner's lemma
• A simple proof of the upper bound theorem
• An algebraic groups perspective on Erdős–Ko–Rado
• An extremal problem for sets with applications to graph theory
• An extremal problem for two families of sets
• Bollobás-type theorems for hemi-bundled two families
• Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
• Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditions
• Erdős-Ko-Rado theorems. Algebraic approaches
• Extremal Finite Set Theory
• Extremal combinatorics. With applications in computer science
• Extremal problems for finite sets
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• Geometrical solution of an intersection problem for two hypergraphs
• Gotzmann theorems for exterior algebras and combinatorics
• Hyperconnectivity of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• Inequalities for two set systems with prescribed intersections
• Intersection patterns of convex sets
• Intersection theorems for systems of finite sets
• Katona's intersection theorem: four proofs
• Logarithmic order of free distributive lattice
• Matchings and covers in hypergraphs
• Monomial Ideals
• On families of weakly cross-intersecting set-pairs
• On generalized graphs
• On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families
• Properties of intersecting families of ordered sets
• Set systems related to a house allocation problem
• Solution of a problem of A. Ehrenfeucht and J. Mycielski
• Solution of an extremal problem for sets using resultants of polynomials
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• Thirty-three miniatures. Mathematical and algorithmic applications of linear algebra
• Weakly saturated hypergraphs and exterior algebra

Cited In (8)

• Problems and results on 1-cross-intersecting set pair systems
• Combinatorial aspects of the Baker-Akhiezer functions for \(S_2\)
• Erdős-Ko-Rado and Hilton-Milner theorems for two-forms
• Bollobás-type theorems for hemi-bundled two families
• On the power of choice for Boolean functions
• An algebraic groups perspective on Erdős–Ko–Rado
• \(K_r\)-saturated graphs and the two families theorem
• Weakly saturated hypergraphs and a conjecture of Tuza

This page was built for publication: Combinatorics in the exterior algebra and the Bollobás two families theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034136)