Abstract:The Alon--Füredi theorem determines the minimum number of hyperplanes needed to cover every nonzero vertex of the Boolean cube while avoiding the origin. We study hyperplane coverings with multiplicity for the generalized hypercube $mB^n=\{0,1,\ldots,m\}^n$. Our main result is a polynomial multiplicity theorem extending the theorem of Sauermann and Wigderson to $mB^n$, with sharp degree bounds for polynomials having prescribed high-order zeros. We apply this result to obtain lower and upper bounds for hyperplane coverings with multiplicity and determine the exact minimum number of hyperplanes for coverings with multiplicities $k=1,2$. In the special case of the Boolean cube, our constructions improve the upper bound of Clifton and Huang for certain ranges of the parameters.
From: Wang Suijie [view email]
[v1]
Sun, 15 Mar 2026 07:44:49 UTC (19 KB)
[v2]
Mon, 20 Apr 2026 14:29:26 UTC (20 KB)
[v3]
Mon, 24 Aug 2026 07:00:11 UTC (21 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。