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

New lower bounds for three-term progression free sets in $\mathbb{F}_p^n$ (2401.12802v1)

Published 23 Jan 2024 in math.CO and math.NT

Abstract: We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_pn$ or $A\subseteq \mathbb{Z}_mn$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for any fixed integer $m\ge 2$ and sufficiently large $n$ (in terms of $m$), there exists a three-term progression free subset $A\subseteq \mathbb{Z}_mn$ of size $|A|\ge (cm)n$ for some absolute constant $c>1/2$. Such a bound for $c=1/2$ can be obtained with a classical construction of Salem and Spencer from 1942, and improving upon this value of $1/2$ has been a well-known open problem (our proof gives $c= 0.54$). Our construction relies on finding a subset $S\subset \mathbb{Z}_m2$ of size at least $(7/24)m2$ with a certain type of reducibility property. This property allows us to ``lift'' $S$ to a three-term progression free subset of $\mathbb{Z}_mn$ for large $n$ (even though the original set $S\subset \mathbb{Z}_m2$ does contain three-term arithmetic progressions).

Summary

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

X Twitter Logo Streamline Icon: https://streamlinehq.com