Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Exponential Lower Bounds on the Generalized Erdős-Ginzburg-Ziv Constant (1712.00861v2)

Published 4 Dec 2017 in math.CO

Abstract: For a finite abelian group $G$, the generalized Erd\H{o}s--Ginzburg--Ziv constant $\mathsf s_{k}(G)$ is the smallest $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. If $n = \exp(G)$ is the exponent of $G$, the previously best known bounds for $\mathsf s_{kn}(C_nr)$ were linear in $n$ and $r$ when $k\ge 2$. Via a probabilistic argument, we produce the exponential lower bound [ \mathsf s_{2n}(C_nr) > \frac{n}{2}[1.25 - O(n{-3/2})]r ] for $n > 0$. For the general case, we show [ \mathsf s_{kn}(C_nr) > \frac{kn}{4}\Big(1+\frac{1}{ek} + O\Big(\frac{1}{n}\Big)\Big)r. ]

Summary

We haven't generated a summary for this paper yet.