Distinct coordinate solutions of linear equations over finite fields

DOI10.1016/J.FFA.2019.101602MaRDI QIDQ2291366zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 30 January 2020

Published in Finite Fields and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

distinct coordinate sievefinite fieldslinear equations

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Abstract: Let $mathbb{F}_q$ be the finite field of $q$ elements and $a_1,a_2,ldots,a_k,binmathbb{F}_q$. We investigate $N_{mathbb{F}_q}(a_1,a_2,ldots,a_k;b)$, the number of ordered solutions $(x_1,x_2,ldots,x_k)inmathbb{F}_q^k$ of the linear equation ${\displaystyle }$ a_1x_1+a_2x_2+cdots+a_kx_k=b${\displaystyle }$ with all $x_i$ distinct. We obtain an explicit formula for $N_{mathbb{F}_q}(a_1,a_2,ldots,a_k;b)$ involving combinatorial numbers depending on $a_i$'s. In particular, we obtain closed formulas for two special cases. One is that $a_i,1leqileqk$ take at most three distinct values and the other is that $su{m}_{i=1}^k{a}_i=0$ and $su{m}_{iinI}{a}_{i}eq0$ for any $Isubsetneq[k]$. The same technique works when $mathbb{F}_q$ is replaced by $mathbb{Z}_n$, the ring of integers modulo $n$. In particular, we give a new proof for the main result given by Bibak, Kapron and Srinivasan, which generalizes a theorem of Sch"{o}nemann via a graph theoretic method.

Recommendations

• scientific article; zbMATH DE number 1159667
• scientific article; zbMATH DE number 1116686
• On the number of solutions of the equation \(a_1x_1^{m_1} + \cdots +a_nx_n^{m_n} = bx_1 \cdots x_n\) in a finite field
• scientific article; zbMATH DE number 5759636
• Counting solutions of special linear equations over finite fields

Cites work

• A generalization of Schönemann's theorem via a graph theoretic method
• A new sieve for distinct coordinate counting
• Arithmetic-progression-weighted subsequence sums
• Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
• Counting compositions over finite abelian groups
• Distinct solution to a linear congruence
• Enumerating permutation polynomials over finite fields by degree
• Enumerating permutation polynomials over finite fields by degree. II
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• Linearized Wenger graphs
• On a conjecture of polynomials with prescribed range
• On the List and Bounded Distance Decodability of Reed–Solomon Codes
• On the Odlyzko-Stanley enumeration problem and Waring's problem over finite fields
• On the subset sum problem over finite fields
• Permutations over cyclic groups
• Permutations, hyperplanes and polynomials over finite fields
• The number of permutation polynomials of a given degree over a finite field
• Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes

Cited in

(5)

• Extensions of Schönemann's theorem in Galois rings
• A generalization of Schönemann's theorem via a graph theoretic method
• scientific article; zbMATH DE number 1262442 (Why is no real title available?)
• Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\)
• Subset sums over Galois rings. II

This page was built for publication: Distinct coordinate solutions of linear equations over finite fields

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