On the number of solutions of a congruence in GF[q,x]
We obtain an estimate on the average cardinality (d,s,a) of the value set of any family of monic polynomials in of degree d for which s consecutive coefficients are fixed. Our estimate asserts that , where . We also prove that , where ₂(d,s,a) is the average second moment of the value set cardinalities for any family of monic polynomials of of degree d with s consecutive coefficients fixed as above. Finally, we show that , where ₂(d,0) denotes the average second moment for all monic polynomials...
This survey deals with pluri-periodic harmonic functions on lattices with values in a field of positive characteristic. We mention, as a motivation, the game “Lights Out” following the work of Sutner [20], Goldwasser- Klostermeyer-Ware [5], Barua-Ramakrishnan-Sarkar [2, 19], Hunzikel-Machiavello-Park [12] e.a.; see also [22, 23] for a more detailed account. Our approach uses harmonic analysis and algebraic geometry over a field of positive characteristic.
It is shown that the invertible polynomial maps over a finite field Fq , if looked at as bijections Fn,q −→ Fn,q , give all possible bijections in the case q = 2, or q = p^r where p > 2. In the case q = 2^r where r > 1 it is shown that the tame subgroup of the invertible polynomial maps gives only the even bijections, i.e. only half the bijections. As a consequence it is shown that a set S ⊂ Fn,q can be a zero set of a coordinate if and only if #S = q^(n−1).
For an odd prime p and an integer w ≥ 1, polynomial quotients are defined by with , u ≥ 0, which are generalizations of Fermat quotients . First, we estimate the number of elements for which for a given polynomial f(x) over the finite field . In particular, for the case f(x)=x we get bounds on the number of fixed points of polynomial quotients. Second, before we study the problem of estimating the smallest number (called the Waring number) of summands needed to express each element of...