arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.14737math.CO
收藏

关于高维的Erdens-Ginzburg-Ziv问题

On the Erdős--Ginzburg--Ziv Problem in large dimension

Lisa Sauermann, Dmitrii Zakharov

摘要:

Erdens-Ginzburg-Ziv问题是离散几何中的一个经典极值问题.给定$m$和$n$,问题询问最小数目$s$,使得在整数格$\mathbb{Z}^n$中的任何$s$点中,可以找到其质心再次是格点的$m$点。尽管在过去的50年里,这个问题受到了很多关注,但还远远没有得到很好的理解。对于固定维数的$n$,Alon和Dubiner证明了答案随$m$线性增长。在本文中,我们专注于相反的情况下,其中的数量$m$是固定的和尺寸$n$是大的。我们大大提高了以前的上界在这个政权,表明对于每个$\varepsilon>0$的答案是最多$D_{\varepsilon,m}\cdot (C_{\varepsilon}m^{\varepsilon})^n$的所有$m$和$n$。我们的证明相结合(的后果)的切片秩多项式方法与更高的均匀性版本的Bennett-Szemerédi-Gowers定理由于Borenstein和Croot。

英文摘要:

The Erdős--Ginzburg--Ziv Problem is a classical extremal problem in discrete geometry. Given $m$ and $n$, the problem asks about the smallest number $s$ such that among any $s$ points in the integer lattice $\mathbb{Z}^n$ one can find $m$ points whose centroid is again a lattice point. Despite of a lot of attention over the last 50 years, this problem is far from well-understood. For fixed dimension $n$, Alon and Dubiner proved that the answer grows linearly with $m$. In this paper, we focus on the opposite case, where the number $m$ is fixed and the dimension $n$ is large. We drastically improve the previous upper bounds in this regime, showing that for every $\varepsilon>0$ the answer is at most $D_{\varepsilon,m}\cdot (C_{\varepsilon}m^{\varepsilon})^n$ for all $m$ and $n$. Our proof combines (a consequence of) the slice rank polynomial method with a higher-uniformity version of the Balog--Szemerédi--Gowers Theorem due to Borenstein and Croot.

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

↑