2000 character limit reached
More on maximal line-free sets in $\mathbb{F}_p^n$ (2403.18611v1)
Published 27 Mar 2024 in math.CO
Abstract: For a prime $p$ we construct a subset of $\mathbb{F}_p{(k2-k)/2}$ of size $p{(k2-k)/2-1}$ that does not contain progressions of length $k$. More generally, we show that for any prime power $q$ there is a subset of $\mathbb{F}_q{(k2-k)/2}$ of size $q{(k2-k)/2-1}$ that does not contain $k$ points on a line. This yields the first asympotic lower bounds $cn$ for the size of $p$-progression-free sets in $\mathbb{F}_p{n}$ with $c=p-o(1)$, as $p$ tends to infinity.