Polynomial quotients: Interpolation, value sets and Waring's problem
From MaRDI portal
(Redirected from Publication:5500820)
Abstract: For an odd prime and an integer , polynomial quotients are defined by q_{p,w}(u)equiv frac{u^w-u^{wp}}{p} �mod p ~~ mathrm{with}~~ 0 le q_{p,w}(u) le p-1, ~~uge 0, which are generalizations of Fermat quotients . First, we estimate the number of elements for which for a given polynomial over the finite field . In particular, for the case 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 as sum of values of polynomial quotients, we prove some lower bounds on the size of their value sets, and then we apply these lower bounds to prove some bounds on the Waring number using results from bounds on additive character sums and additive number theory.
Recommendations
- On the interpolation of integer-valued polynomials
- Polynomial interpolation and generalizations of mean value theorem
- scientific article; zbMATH DE number 1944720
- scientific article; zbMATH DE number 3777795
- scientific article; zbMATH DE number 125031
- scientific article; zbMATH DE number 3886493
- scientific article; zbMATH DE number 50258
- Interpolation by integer-valued polynomials
- Polynomial interpolation in nondivision algebras
Cites work
- A note on Waring's problem in finite fields
- Additive character sums of polynomial quotients
- Boolean functions derived from Fermat quotients
- Bounds of multiplicative character sums with Fermat quotients of primes
- Character sums with Fermat quotients
- Distribution of values of polynomial Fermat quotients
- Exact solutions to Waring's problem for finite fields
- Fermat quotients for composite moduli
- Fermat quotients over function fields
- Fermat quotients: exponential sums, value set and primitive roots
- scientific article; zbMATH DE number 903706 (Why is no real title available?)
- Interpolation of Fermat quotients
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Linear complexity of binary sequences derived from polynomial quotients
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- On Character Sums and L -Series. II
- On Heilbronn's exponential sum
- On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients
- On the divisibility of Fermat quotients
- ON THE KUMMER–MIRIMANOFF CONGRUENCES
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- On the value set of Fermat quotients
- On the Waring problem with Dickson polynomials in finite fields
- On the Waring problem with multivariate Dickson polynomials
- On the 𝑝-divisibility of Fermat quotients
- On Waring's problem in finite fields
- Products of small integers in residue classes and additive properties of Fermat quotients
- Pseudorandomness and dynamics of Fermat quotients
- Short character sums with Fermat quotients
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- The arithmetic of Carmichael quotients
- Waring's problem in finite fields with Dickson polynomials
- Waring's problem in function fields
Cited in
(3)
This page was built for publication: Polynomial quotients: Interpolation, value sets and Waring's problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500820)