Intersecting faces of a simplicial complex via algebraic shifting
S. A. Seyed Fakhari

TL;DR
This paper proves Borg's conjecture on the size of $t$-intersecting faces in simplicial complexes using algebraic shifting, extending results to sequentially Cohen-Macaulay $i$-near-cones.
Contribution
It provides a new proof of Borg's conjecture for shifted complexes and verifies it for sequentially Cohen-Macaulay $i$-near-cones using algebraic shifting.
Findings
Borg's conjecture holds for shifted complexes.
Verification of Borg's conjecture for sequentially Cohen-Macaulay $i$-near-cones.
New proof techniques based on algebraic shifting.
Abstract
A family of sets is {\it -intersecting} if the cardinality of the intersection of every pair of sets in is at least , and is an {\it -family} if every set in has cardinality . A well-known theorem of Erd\H{o}s, Ko, and Rado bounds the cardinality of a -intersecting -family of subsets of an -element set, or equivalently of -dimensional faces of a simplex with vertices. As a generalization of the Erd\H{o}s-Ko-Rado theorem, Borg presented a conjecture concerning the size of a -intersecting -family of faces of an arbitrary simplicial complex. He proved his conjecture for shifted complexes. In this paper we give a new proof for this result based on work of Woodroofe. Using algebraic shifting we verify Borg's conjecture in the case of sequentially Cohen-Macaulay -near-cones for .
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
TopicsTopological and Geometric Data Analysis · Limits and Structures in Graph Theory · Digital Image Processing Techniques
