On the Number of Solutions of Diagonal Equations over a Finite Field
โ Scribed by Qi Sun; Ping-Zhi Yuan
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 181 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper, we give a reduction theorem for the number of solutions of any diagonal equation over a finite field. Using this reduction theorem and the theory of quadratic equations over a finite field, we also get an explicit formula for the number of solutions of a diagonal equation over a finite field, under a certain natural restriction on the exponents.
๐ SIMILAR VOLUMES
By using results of coding theory, we give results on the number of solutions of some systems of diagonal equations over finite fields.
The largest possible number of representations of an integer in the k-fold sumset kA=A+ } } } +A is maximal for A being an arithmetic progression. More generally, consider the number of solutions of the linear equation where c i {0 and \* are fixed integer coefficients, and where the variables a i
We relate the number of permutation polynomials in F q ยฝx of degree d q ร 2 to the solutions รฐx 1 ; x 2 ; . . . ; x q ร of a system of linear equations over F q , with the added restriction that x i =0 and x i =x j whenever i=j. Using this we find an expression for the number of permutation polynomi
We study value sets of polynomials over a finite field, and value sets associated to pairs of such polynomials. For example, we show that the value sets (counting multiplicities) of two polynomials of degree at most d are identical or have at most q!(q!1)/d values in common where q is the number of