arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1904.09560math.COmath.NT
收藏

关于不含$p$不同元素总和为零的$\mathbb{F}_p^{n}$子集的大小

On the size of subsets of $\mathbb{F}_p^{n}$ without $p$ distinct elements summing to zero

Lisa Sauermann

摘要:

让我们修复一个主要的$p$。Erdens-Ginzburg-Ziv问题要求最小整数$s$,使得格点$\mathbb{Z}^n$中的任何$s$点的集合包含其质心也是$\mathbb{Z}^n$中的格点的$p$点。对于大的$n$,这实质上等同于要求$\mathbb{F}_p^n$的子集的最大大小,而$p$不同元素的总和不为零。本文对任意固定素数$p\geq 5$和大$n$给出了该问题的一个新的上界。特别是,我们证明了$\mathbb{F}_p^n$的任何子集没有$p$不同的元素总和为零的大小最多$C_p\cdot \left(2\sqrt{p}\right)^n$,其中$C_p$是一个常数,只取决于$p$。当$p$和$n$趋于无穷大时,我们的上界是$p^{(1/2)\cdot (1+o(1))n}$的形式,而所有以前已知的上界都是$p^{(1-o(1))n}$的形式(其中$p^n$是平凡的上界)。我们的证明使用所谓的多色和自由定理,这是一个后果的Croot-Lev-Pach多项式方法。这种方法及其后果已经适用于纳斯伦德以及福克斯和作者证明边界的问题在本文中研究。然而,使用一些关键的新想法,我们显着提高他们的界限。

英文摘要:

Let us fix a prime $p$. The Erdős-Ginzburg-Ziv problem asks for the minimum integer $s$ such that any collection of $s$ points in the lattice $\mathbb{Z}^n$ contains $p$ points whose centroid is also a lattice point in $\mathbb{Z}^n$. For large $n$, this is essentially equivalent to asking for the maximum size of a subset of $\mathbb{F}_p^n$ without $p$ distinct elements summing to zero. In this paper, we give a new upper bound for this problem for any fixed prime $p\geq 5$ and large $n$. In particular, we prove that any subset of $\mathbb{F}_p^n$ without $p$ distinct elements summing to zero has size at most $C_p\cdot \left(2\sqrt{p}\right)^n$, where $C_p$ is a constant only depending on $p$. For $p$ and $n$ going to infinity, our bound is of the form $p^{(1/2)\cdot (1+o(1))n}$, whereas all previously known upper bounds were of the form $p^{(1-o(1))n}$ (with $p^n$ being a trivial bound). Our proof uses the so-called multi-colored sum-free theorem which is a consequence of the Croot-Lev-Pach polynomial method. This method and its consequences were already applied by Naslund as well as by Fox and the author to prove bounds for the problem studied in this paper. However, using some key new ideas, we significantly improve their bounds.

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

↑