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

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

Abstract: Let us fix a prime

p

and a homogeneous system of

m

linear equations

a_{j, 1} x_{1} + d o t s + a_{j, k} x_{k} = 0

for

j = 1, d o t s, m

with coefficients

a_{j, i} i n m a t h b b F_{p}

. Suppose that

k g e q 3 m

, that

a_{j, 1} + d o t s + a_{j, k} = 0

for

j = 1, d o t s, m

and that every

m i m e s m

minor of the

m i m e s k

matrix

(a_{j, i})_{j, i}

is non-singular. Then we prove that for any (large)

n

, any subset

A s u b s e t e q m a t h b b F_{p}^{n}

of size

| A | > C c d o t G a m m a^{n}

contains a solution

(x_{1}, d o t s, x_{k}) i n A^{k}

to the given system of equations such that the vectors

x_{1}, d o t s, x_{k} i n A

are all distinct. Here,

C

and

G a m m a

are constants only depending on

p

,

m

and

k

such that

G a m m a < p

. The crucial point here is the condition for the vectors

x_{1}, d o t s, x_{k}

in the solution

(x_{1}, d o t s, x_{k}) i n A^{k}

to be distinct. If we relax this condition and only demand that

x_{1}, d o t s, 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.

Recommendations

Cites work

Cited in

(3)

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)