English

Irredundant hyperplane covers

Combinatorics 2022-11-01 v2

Abstract

We prove that if GG is an abelian group and H1x1,,HkxkH_1x_1,\dots,H_{k}x_k is an irredundant (minimal) cover of GG with cosets, then G:i=1kHi=2O(k).|G:\bigcap_{i=1}^{k}H_{i}|=2^{O(k)}. This bound is the best possible up to the constant hidden in the O()O(\cdot) notation, and it resolves conjectures of Pyber (1996) and Szegedy (2007). We further show that if GG is an elementary pp-group for some large prime pp, and H1,,HkH_1,\dots,H_k 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\alpha>0 such that for every invertible matrix MFpn×nM\in\mathbb{F}_p^{n\times n} and any set of at most pαp^{\alpha} forbidden coordinates, one can find a vector xFpnx\in\mathbb{F}_p^{n} such that neither xx nor MxMx have a forbidden coordinate.

Keywords

Cite

@article{arxiv.2205.03389,
  title  = {Irredundant hyperplane covers},
  author = {János Nagy and Péter Pál Pach and István Tomon},
  journal= {arXiv preprint arXiv:2205.03389},
  year   = {2022}
}

Comments

There is a mistake in the proof of the main result, more specifically in the proof of Claim 4.5, Section 4.2. This invalidates most of the paper

R2 v1 2026-06-24T11:09:41.315Z