当前位置: X-MOL 学术J. Comb. Theory A › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Exponential bounds for the Erdős-Ginzburg-Ziv constant
Journal of Combinatorial Theory Series A ( IF 1.1 ) Pub Date : 2020-03-17 , DOI: 10.1016/j.jcta.2019.105185
Eric Naslund

The Erdős-Ginzburg-Ziv constant of a finite abelian group G, denoted s(G), is the smallest kN such that any sequence of elements of G of length k contains a zero-sum subsequence of length exp(G). In this paper, we use the partition rank from [14], which generalizes the slice rank, to prove that for any odd prime p,s(Fpn)(p1)2p(J(p)p)n where 0.8414<J(p)<0.91837. For large n, and p>3, this is the first exponential improvement to the trivial bound. We also provide a near optimal result conditional on the conjecture that (Z/kZ)n satisfies property D, as defined in [9], showing that in this cases((Z/kZ)n)(k1)4n+k.



中文翻译:

Erdős-Ginzburg-Ziv常数的指数界

有限阿贝尔群G的Erdős-Ginzburg-Ziv常数,表示为sG,是最小的 ķñ使得元件的任何序列ģ长度的ķ包含长度的零和子序列经验值G。在本文中,我们使用[14]中的划分等级,对划分等级进行了概括,证明对于任何奇数素数psFpñp-1个2pĴppñ 哪里 0.8414<Ĵp<0.91837。对于大n,和p>3,这是对微不足道范围的首次指数改进。我们还根据以下猜想提供了接近最佳的结果:ž/ķžñ满足[9]中定义的属性D,表明在这种情况下sž/ķžñķ-1个4ñ+ķ

更新日期:2020-03-17
down
wechat
bug