Irredundant hyperplane covers
J\'anos Nagy, P\'eter P\'al Pach, Istv\'an Tomon

TL;DR
This paper proves a tight bound on the size of irredundant coset covers in abelian groups, resolving longstanding conjectures, and improves bounds for hyperplane covers in large prime fields, with applications to the Alon-Jaeger-Tarsi conjecture.
Contribution
It establishes the optimal bound for irredundant coset covers in abelian groups and enhances bounds for hyperplane covers in large prime fields, leading to a strengthened version of the Alon-Jaeger-Tarsi conjecture.
Findings
Bound |G : intersection of H_i| = 2^{O(k)} is tight and resolves conjectures.
Improved bounds for hyperplanes in elementary p-groups with many repetitions.
Strengthened Alon-Jaeger-Tarsi conjecture for large prime fields.
Abstract
We prove that if is an abelian group and is an irredundant (minimal) cover of with cosets, then This bound is the best possible up to the constant hidden in the notation, and it resolves conjectures of Pyber (1996) and Szegedy (2007). We further show that if is an elementary -group for some large prime , and 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 such that for every invertible matrix and any set of at most forbidden coordinates, one can find a vector such that neither nor have a forbidden coordinate.
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
TopicsManufacturing Process and Optimization · Advanced Numerical Analysis Techniques · Constraint Satisfaction and Optimization
