2000 character limit reached
The large $k$-term progression-free sets in $\mathbb{Z}_q^n$
Published 2 Oct 2016 in math.NT | (1610.00247v3)
Abstract: Let $k$ and $n$ be fixed positive integers. For each prime power $q\geqslant k\geqslant 3$, we show that any subset $A\subseteq \mathbb{Z}_qn$ free of $k$-term arithmetic progressions has size $|A|\leqslant c_k(q)n$ with a constant $c_k(q)$ that can be expressed explicitly in terms of $k$ and $q$. As a consequence, we can take $c_k(q)=0.8415q$ for sufficiently large $q$ and arbitrarily fixed $k\geq 3$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.