Page 1

Displaying 1 – 3 of 3

Showing per page

Polynomial quotients: Interpolation, value sets and Waring's problem

Zhixiong Chen, Arne Winterhof (2015)

Acta Arithmetica

For an odd prime p and an integer w ≥ 1, polynomial quotients q p , w ( u ) are defined by q p , w ( u ) ( u w - u w p ) / p m o d p with 0 q p , w ( u ) p - 1 , u ≥ 0, which are generalizations of Fermat quotients q p , p - 1 ( u ) . First, we estimate the number of elements 1 u < N p for which f ( u ) q p , w ( u ) m o d p for a given polynomial f(x) over the finite field p . 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...

Proof of a conjectured three-valued family of Weil sums of binomials

Daniel J. Katz, Philippe Langevin (2015)

Acta Arithmetica

We consider Weil sums of binomials of the form W F , d ( a ) = x F ψ ( x d - a x ) , where F is a finite field, ψ: F → ℂ is the canonical additive character, g c d ( d , | F × | ) = 1 , and a F × . If we fix F and d, and examine the values of W F , d ( a ) as a runs through F × , we always obtain at least three distinct values unless d is degenerate (a power of the characteristic of F modulo | F × | ). Choices of F and d for which we obtain only three values are quite rare and desirable in a wide variety of applications. We show that if F is a field of order 3ⁿ with n odd, and d = 3 r + 2 with...

Currently displaying 1 – 3 of 3

Page 1