Irredundant hyperplane covers
Abstract
We prove that if G is an abelian group and H1x1,…,Hkxk is an irredundant (minimal) cover of G with cosets, then |G:i=1kHi|=2O(k). This bound is the best possible up to the constant hidden in the O(·) notation, and it resolves conjectures of Pyber (1996) and Szegedy (2007). We further show that if G is an elementary p-group for some large prime p, and H1,…,Hk is a sequence of hyperplanes with many repetitions, then the bound above can be improved. As a consequence, we establish a substantial strengthening of the recently solved Alon-Jaeger-Tarsi conjecture: there exists α>0 such that for every invertible matrix M∈Fpn× n and any set of at most pα forbidden coordinates, one can find a vector x∈Fpn such that neither x nor Mx have a forbidden coordinate.
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.