Refinements of Alon-Babai-Suzuki-type intersection theorems via non-shadows and binomial support
Jiangdong Ai, Mingyu Liu

TL;DR
This paper refines intersection theorems by introducing non-shadow and modular support techniques, sharpening bounds on set families with restricted intersections, and providing new insights into the structure of such families.
Contribution
It introduces a multilevel non-shadow refinement of the ABS intersection theorem and a coefficient-sensitive polynomial method for modular bounds, advancing understanding of intersection set families.
Findings
Sharpened bounds on L-intersecting families using non-shadow deficits.
Modular bounds depending on active polynomial support levels.
Counterexamples to attainability of certain modular bounds.
Abstract
We prove a multilevel non-shadow refinement of the Alon--Babai--Suzuki (ABS) nonuniform restricted-intersection theorem. Let and let be a set with . If is -intersecting and for every , then equivalently Thus the ABS bound is sharpened by the total non-shadow deficit on the top levels. In the modular setting, we take a coefficient-sensitive viewpoint: the polynomial method depends not just on the degree of the annihilator polynomial , but on which binomial terms actually appear in it. This yields a gap-free modular bound depending only on the active support levels of . 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
TopicsPolynomial and algebraic computation · Computational Geometry and Mesh Generation · Advanced Combinatorial Mathematics
