On symmetric intersecting families of vectors
Sean Eberhard, Jeff Kahn, Bhargav Narayanan, Sophie Spirkl

TL;DR
This paper proves that symmetric intersecting families of vectors over a fixed alphabet size have subexponential size, contrasting with the Boolean case, by developing new methods beyond existing spectral techniques.
Contribution
The paper introduces a novel approach to analyze symmetric intersecting families of vectors for fixed alphabet sizes, overcoming limitations of current spectral methods.
Findings
Symmetric intersecting families are significantly smaller than the total space for fixed k ≥ 3.
The size of such families is o(k^n), indicating subexponential growth.
Existing spectral techniques are insufficient, prompting the development of new methods.
Abstract
A family of vectors is said to be intersecting if any two elements of agree on at least one coordinate. We prove, for fixed , that the size of a symmetric intersecting subfamily of is , which is in stark contrast to the case of the Boolean hypercube (where ). Our main contribution addresses limitations of existing technology: while there is now some spectral machinery, developed by Ellis and the third author, to tackle extremal problems in set theory involving symmetry, this machinery relies crucially on the interplay between up-sets and biased product measures on the Boolean hypercube, features that are notably absent in the problem at hand; here, we describe a method for circumventing these barriers.
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.
