Finding solutions with distinct variables to systems of linear equations over F_p

DOI10.1007/S00208-022-02391-YzbMATH Open1529.11020arXiv2105.06863OpenAlexW3162596025MaRDI QIDQ6041804FDOQ6041804

Authors: Lisa Sauermann 

Publication date: 15 May 2023

Published in: Mathematische Annalen (Search for Journal in Brave)

Abstract: Let us fix a prime $p$ and a homogeneous system of $m$ linear equations $a_{j,1}{x}_1+dots+a_{j,k}{x}_k=0$ for $j=1,dots,m$ with coefficients $a_{j,i}inmathbb{F}_p$. Suppose that $kgeq3m$, that $a_{j,1}+dots+a_{j,k}=0$ for $j=1,dots,m$ and that every $mimesm$ minor of the $mimesk$ matrix $(a_{j,i}{)}_{j,i}$ is non-singular. Then we prove that for any (large) $n$, any subset $Asubseteqmathbb{F}_p^n$ of size $|A|>CcdotGamm{a}^n$ contains a solution $(x_1,dots,x_k)in{A}^k$ to the given system of equations such that the vectors $x_1,dots,x_{k}inA$ are all distinct. Here, $C$ and $Gamma$ are constants only depending on $p$, $m$ and $k$ such that $Gamma<p$. The crucial point here is the condition for the vectors $x_1,dots,x_k$ in the solution $(x_1,dots,x_k)in{A}^k$ to be distinct. If we relax this condition and only demand that $x_1,dots,x_k$ are not all equal, then the statement would follow easily from Tao's slice rank polynomial method. However, handling the distinctness condition is much harder, and requires a new approach. While all previous combinatorial applications of the slice rank polynomial method have relied on the slice rank of diagonal tensors, we use a slice rank argument for a non-diagonal tensor in combination with combinatorial and probabilistic arguments.

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

Recommendations

• On the size of subsets of \(\mathbb{F}_q^n\) avoiding solutions to linear systems with repeated columns
• Distinct coordinate solutions of linear equations over finite fields
• scientific article; zbMATH DE number 3995754
• Simultaneous diagonal p –adic equations
• scientific article; zbMATH DE number 7283881

zbMATH Keywords

slice rank argument for non-diagonal tensor

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Polynomials over finite fields (11T06) Arithmetic combinatorics; higher degree uniformity (11B30) Finite ground fields in algebraic geometry (14G15)

Cites Work

• Solving a linear equation in a set of integers I
• Solving a linear equation in a set of integers II
• Title not available (Why is that?)
• A removal lemma for systems of linear equations over finite fields
• A proof of Green's conjecture regarding the removal properties of sets of linear equations
• Combinatorial problems in finite fields and Sidon sets
• Extensions of generalized product caps
• On subsets of finite Abelian groups with no 3-term arithmetic progressions
• New bounds on cap sets
• AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
• On Some Sequences of Integers
• New bounds for Szemerédi's theorem, I: progressions of length 4 in finite field geometries
• Linear problems in combinatorial number theory
• Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
• 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
• Exponential bounds for the Erdős-Ginzburg-Ziv constant
• On cap sets and the group-theoretic approach to matrix multiplication
• Solving linear equations in a vector space over a finite field
• On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero
• On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions
• New applications of the polynomial method: the cap set conjecture and beyond
• Caps and progression-free sets in \(\mathbb{Z}_m^n\)

Cited In (3)

• Solving linear equations in a vector space over a finite field
• Finding a basis of a linear system with pairwise distinct discrete valuations on an algebraic curve
• On the size of subsets of \(\mathbb{F}_q^n\) avoiding solutions to linear systems with repeated columns

This page was built for publication: Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041804)