We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

math.CO

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Mathematics > Combinatorics

Title: More on maximal line-free sets in $\mathbb{F}_p^n$

Authors: Jakob Führer
Abstract: For a prime $p$ we construct a subset of $\mathbb{F}_p^{(k^2-k)/2}$ of size $p^{(k^2-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^{(k^2-k)/2}$ of size $q^{(k^2-k)/2-1}$ that does not contain $k$ points on a line. This yields the first asympotic lower bounds $c^n$ for the size of $p$-progression-free sets in $\mathbb{F}_p^{n}$ with $c=p-o(1)$, as $p$ tends to infinity.
Subjects: Combinatorics (math.CO)
MSC classes: 51E21, 11B25, 05D05
Cite as: arXiv:2403.18611 [math.CO]
  (or arXiv:2403.18611v1 [math.CO] for this version)

Submission history

From: Jakob Führer [view email]
[v1] Wed, 27 Mar 2024 14:27:10 GMT (12kb)

Link back to: arXiv, form interface, contact.