Papers
Topics
Authors
Recent
2000 character limit reached

Irredundant hyperplane covers

Published 6 May 2022 in math.CO | (2205.03389v2)

Abstract: We prove that if $G$ is an abelian group and $H_1x_1,\dots,H_{k}x_k$ is an irredundant (minimal) cover of $G$ with cosets, then $$|G:\bigcap_{i=1}{k}H_{i}|=2{O(k)}.$$ This bound is the best possible up to the constant hidden in the $O(\cdot)$ 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 $H_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 $\alpha>0$ such that for every invertible matrix $M\in\mathbb{F}_p{n\times n}$ and any set of at most $p{\alpha}$ forbidden coordinates, one can find a vector $x\in\mathbb{F}_p{n}$ such that neither $x$ nor $Mx$ have a forbidden coordinate.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.