Refinements of Alon-Babai-Suzuki-type intersection theorems via non-shadows and binomial support

Abstract

We prove a multilevel non-shadow refinement of the Alon--Babai--Suzuki (ABS) nonuniform restricted-intersection theorem. Let K=\k1,…,kr\ and let L be a set with |L|=s. If F⊂eq k∈ K[n]k is L-intersecting and ki>s-r for every i, then |F| + Σj=s-r+1s |Nj(F)| N(n,s,r), equivalently |F| Σj=s-r+1s |∂jF|. Thus the ABS bound is sharpened by the total non-shadow deficit on the top r levels. In the modular setting, we take a coefficient-sensitive viewpoint: the polynomial method depends not just on the degree of the annihilator polynomial PL(t)=Π∈ L(t-)∈Fp[t], but on which binomial terms actually appear in it. This yields a gap-free modular bound depending only on the active support levels of PL. For almost-initial residue patterns L=\0,1,…,s-m-1\ R p we obtain the collapse |F| Σi=0mns-i. In particular, for consecutive residues L=\0,1,…,s-1\ p we get the sharp bound |F| ns, giving a partial negative answer to a question of Alon--Babai--Suzuki: the modular ABS bound N(n,s,r) is not attainable in the consecutive-residue regime whenever r 2.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…