On the size of subsets of $\mathbb{F}_q^n$ avoiding solutions to linear systems with repeated columns
Josse van Dobben de Bruyn, Dion Gijswijt

TL;DR
This paper investigates the size of subsets in finite fields avoiding solutions to certain linear systems with repeated columns, establishing bounds for the existence of non-degenerate solutions and implications for sets avoiding arithmetic progressions.
Contribution
It extends previous work by providing a unified proof for systems with repeated columns, identifying conditions for large subsets to contain non-degenerate solutions, and linking to progression-free sets.
Findings
Large subsets contain non-degenerate solutions for many systems with repeated columns.
Sets avoiding non-trivial arithmetic progressions have exponentially small density.
The results unify and extend prior work by Mimura, Tokushige, and Sauermann.
Abstract
Consider a system of balanced linear equations in variables with coefficients in . If , then a routine application of the slice rank method shows that there are constants with such that, for every subset of size at least , the system has a solution with not all equal. Building on a series of papers by Mimura and Tokushige and on a paper by Sauermann, this paper investigates the problem of finding a solution of higher non-degeneracy; that is, a solution where are pairwise distinct, or even a solution where do not satisfy any balanced linear equation that is not a linear combination of the equations in the system. In this paper, we focus on linear systems with repeated columns. For a large…
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 · Analytic Number Theory Research · Advanced Graph Theory Research
