Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 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

Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions (1708.09100v2)

Published 30 Aug 2017 in math.CO and math.NT

Abstract: For a finite abelian group $G$, the Erd\H{o}s-Ginzburg-Ziv constant $\mathfrak{s}(G)$ is the smallest $s$ such that every sequence of $s$ (not necessarily distinct) elements of $G$ has a zero-sum subsequence of length $\operatorname{exp}(G)$. For a prime $p$, let $r(\mathbb{F}_pn)$ denote the size of the largest subset of $\mathbb{F}_pn$ without a three-term arithmetic progression. Although similar methods have been used to study $\mathfrak{s}(G)$ and $r(\mathbb{F}_pn)$, no direct connection between these quantities has previously been established. We give an upper bound for $\mathfrak{s}(G)$ in terms of $r(\mathbb{F}_pn)$ for the prime divisors $p$ of $\operatorname{exp}(G)$. For the special case $G=\mathbb{F}_pn$, we prove $\mathfrak{s}(\mathbb{F}_pn)\leq 2p\cdot r(\mathbb{F}_pn)$. Using the upper bounds for $r(\mathbb{F}_pn)$ of Ellenberg and Gijswijt, this result improves the previously best known upper bounds for $\mathfrak{s}(\mathbb{F}_pn)$ given by Naslund.

Summary

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