English

On uniform eventowns

Combinatorics 2026-08-06 v1

Abstract

Suppose that n=2mn=2m, k=2tk=2t and n>10k7n > 10 k^7. We show that if a family F\mathcal F of kk-subsets of an nn-set has only even pairwise intersections then F(mt)|\mathcal F| \leq \binom{m}{t}. Moreover, every extremal family has an atomic structure. This result was previously proved by Frankl and Tokushige for n>nFT(k)n > n_{FT}(k), where nFT(k)n_{FT}(k) is at least exponential. The main technique is Delsarte linear programming.

Cite

@article{arxiv.2608.06248,
  title  = {On uniform eventowns},
  author = {Danila Cherkashin and Pavel Prozorov},
  journal= {arXiv preprint arXiv:2608.06248},
  year   = {2026}
}

Comments

21 page