The large $k$-term progression-free sets in $\mathbb{Z}_q^n$

TL;DR

This paper establishes explicit upper bounds on the size of subsets in vector spaces over finite fields that avoid k-term arithmetic progressions, improving understanding of their structure and size limitations.

Contribution

It provides explicit bounds on progression-free sets in q^n, including a specific bound of 0.8415q for large q, advancing previous theoretical results.

Findings

Progression-free sets have size at most c_k(q)^n.

Explicit bounds depend on parameters k and q.

For large q, the bound c_k(q) can be taken as 0.8415q.

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}_q^n$ 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$.