On the size of subsets of \(\mathbb{F}_q^n\) avoiding solutions to linear systems with repeated columns

DOI10.37236/10883arXiv2111.09879OpenAlexW3212552559MaRDI QIDQ6197305

Dion C. Gijswijt, Josse van Dobben de Bruyn

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.09879

zbMATH Keywords

arithmetic progressionexponentially small densitylinear systems with repeated columnssolution of higher non-degeneracy

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero
• Exponential bounds for the Erdős-Ginzburg-Ziv constant
• Solving linear equations in a vector space over a finite field
• Solving a linear equation in a set of integers I
• On cap sets and the group-theoretic approach to matrix multiplication
• Solving a linear equation in a set of integers II
• Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\)
• Unnamed Item
• Unnamed Item

This page was built for publication: On the size of subsets of \(\mathbb{F}_q^n\) avoiding solutions to linear systems with repeated columns