arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2101.11947math.CO
收藏

多重子空间覆盖

Subspace coverings with multiplicities

Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das, Tamás Mészáros

摘要:

研究了余维$d$的仿射子空间的最小个数$f(n,k,d)$的确定问题,这些子空间至少覆盖$\mathbb{F}_2^n\setminus \{\vec{0}\}$的所有点$k$次,同时最多覆盖原点$k-1$次. $k=1$是Jamison的一个经典结果,由Brouwer和Schrijver为$d = 1$独立获得。$f(n,1,1)$的值也来自于阿隆和富雷迪关于任意域上仿射空间中有限网格覆盖的著名定理。在这里,我们确定这个函数的值,正是在各种范围内的参数。特别地,我们证明了对于$k \ge 2^{n-d-1}$,我们有$f(n,k,d)=2^d k - \left \lfloor \frac{k}{2^{n-d}} \right \rfloor$,而对于$n > 2^{2^d k-k-d+1}$,我们有$f(n,k,d)= n + 2^dk-d-2$,并研究了这两个范围之间的过渡。虽然以前在这个方向上的工作主要采用多项式方法,我们证明我们的结果,通过更直接的组合和概率参数,并利用连接到编码理论。

英文摘要:

We study the problem of determining the minimum number $f(n,k,d)$ of affine subspaces of codimension $d$ that are required to cover all points of $\mathbb{F}_2^n\setminus \{\vec{0}\}$ at least $k$ times while covering the origin at most $k-1$ times. The case $k=1$ is a classic result of Jamison, which was independently obtained by Brouwer and Schrijver for $d = 1$. The value of $f(n,1,1)$ also follows from a well-known theorem of Alon and Füredi about coverings of finite grids in affine spaces over arbitrary fields. Here we determine the value of this function exactly in various ranges of the parameters. In particular, we prove that for $k \ge 2^{n-d-1}$ we have $f(n,k,d)=2^d k - \left \lfloor \frac{k}{2^{n-d}} \right \rfloor$, while for $n > 2^{2^d k-k-d+1}$ we have $f(n,k,d)= n + 2^dk-d-2$, and also study the transition between these two ranges. While previous work in this direction has primarily employed the polynomial method, we prove our results through more direct combinatorial and probabilistic arguments, and also exploit a connection to coding theory.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑