Maximal line-free sets in $\mathbb{F}_p^n$
Christian Elsholtz, Jakob F\"uhrer, Erik F\"uredi, Benedek Kov\'acs, P\'eter P\'al Pach, D\'aniel G\'abor Simon, N\'ora Velich

TL;DR
This paper investigates the maximum size of subsets in finite fields that contain no full line, providing new bounds and constructions especially in three dimensions, with implications for higher dimensions.
Contribution
It introduces improved bounds for the size of line-free sets in $F_p^n$, particularly in three dimensions, and extends results to higher dimensions with explicit constructions and asymptotic estimates.
Findings
Established a new lower bound for $r_p(F_p^3)$ that increases with $p$
Provided an upper bound for $r_p(F_p^3)$ and generalizations to higher dimensions
Derived asymptotic lower bounds for specific primes and dimensions
Abstract
We study subsets of that do not contain progressions of length . We denote by the cardinality of such subsets containing a maximal number of elements. In this paper we focus on the case and therefore sets containing no full line. A~trivial lower bound is achieved by a hypercube of side length and it is known that equality holds for . We will however show that , which is the first improvement in the three dimensional case that is increasing in . We will also give the upper bound as well as generalizations for higher dimensions. Finally we present some bounds for individual and , in particular and which can be used…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory
