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

Caps and progression-free sets in $\mathbb{Z}_m^n$ (1903.08266v1)

Published 19 Mar 2019 in math.CO and math.NT

Abstract: We study progression-free sets in the abelian groups $G=(\mathbb{Z}mn,+)$. Let $r_k(\mathbb{Z}_mn)$ denote the maximal size of a set $S \subset \mathbb{Z}_mn$ that does not contain a proper arithmetic progression of length $k$. We give lower bound constructions, which e.g. include that $r_3(\mathbb{Z}_mn) \geq C_m \frac{((m+2)/2)n}{\sqrt{n}}$, when $m$ is even. When $m=4$ this is of order at least $3n/\sqrt{n}\gg \vert G \vert{0.7924}$. Moreover, if the progression-free set $S\subset \mathbb{Z}_4n$ satisfies a technical condition, which dominates the problem at least in low dimension, then $|S|\leq 3n$ holds. We present a number of new methods which cover lower bounds for several infinite families of parameters $m,k,n$, which includes for example: $r_6(\mathbb{Z}{125}n) \geq (85-o(1))n$. For $r_3(\mathbb{Z}_4n)$ we determine the exact values, when $n \leq 5$, e.g. $r_3(\mathbb{Z}_45)=124$, and for $r_4(\mathbb{Z}_4n)$ we determine the exact values, when $n \leq 4$, e.g. $r_4(\mathbb{Z}_44)=128$.

Summary

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