Exponential sums with sparse polynomials over finite fields
From MaRDI portal
Abstract: We obtain new bounds of exponential sums modulo a prime with sparse polynomials . The bounds depend on various greatest common divisors of exponents and their differences. In particular, two new bounds for binomials are obtained, improving previous results in broad ranges of parameters.
Recommendations
Cites work
- A further refinement of Mordell's bound on exponential sums
- A generalization of the Goresky-Klapper conjecture. I
- A system of simultaneous congruences arising from trinomial exponential sums
- Algebraic entropy, automorphisms and sparsity of algebraic dynamical systems and pseudorandom number generators
- An improved Mordell type bound for exponential sums
- Arithmetic crosscorrelations of feedback with carry shift register sequences
- Binomial exponential sums
- Bounds of trilinear and trinomial exponential sums
- Bounds on exponential sums with quadrinomials
- Bounds on fewnomial exponential sums over ℤp
- Decimations of -sequences and permutations of even residues mod p
- Explicit bounds on monomial and binomial exponential sums
- scientific article; zbMATH DE number 3206360 (Why is no real title available?)
- scientific article; zbMATH DE number 3248147 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- Multiplicative energy of shifted subgroups and bounds on exponential sums with trinomials in finite fields
- New bounds for Gauss sums derived from KTH powers, and for Heilbronn's exponential sum
- On asymptotic formulae in some sum-product questions
- On Decimations of $\ell$-Sequences
- On the few products, many sums problem
- On the parity of k-th powers modulo p. A generalization of a problem of Lehmer
- On the power generator and its multivariate analogue
- On the statistical properties of Diffie-Hellman distributions
- Proof of the Goresky--Klapper conjecture on decimations of \(L\)-sequences
- Some new inequalities in additive combinatorics
- Stepanov's Method Applied to Binomial Exponential Sums
Cited in
(15)- Exponential sums and prime divisors of sparse integers
- On exponential sums with sparse polynomials and rational functions
- A note on bilinear exponential sums in prime fields
- Bounds of some double exponential sums
- Bound for mixed exponential sums associated to binary good cyclic codes
- Several classes of exponential sums and three-valued Walsh spectrums over finite fields
- Roots of sparse polynomials over a finite field
- Explicit bounds on monomial and binomial exponential sums
- Roots of Polynomials in Subgroups of and Applications to Congruences
- scientific article; zbMATH DE number 1241332 (Why is no real title available?)
- Sparse polynomial exponential sums
- On the lower bound of the divisibility of exponential sums in binomial case
- Binomial exponential sums
- Weil Sums over Small Subgroups
- On a family of sparse exponential sums
This page was built for publication: Exponential sums with sparse polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4990399)