Character sums over sparse elements of finite fields

DOI10.1112/BLMS.13008MaRDI QIDQ6203676zbMATH OpenOpenAlexFDO

Authors László Mérai, Igor E. Shparlinski, Arne Winterhof

Publication date 6 April 2024

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2211.08452

Mathematics Subject Classification ID

Exponential sums (11T23)

Abstract: We estimate mixed character sums of polynomial values over elements of a finite field $mathbb{F}_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $mathbb{F}_q$. First we use a combination of the inclusion-exclusion principle with bounds on character sums over linear subspaces to get nontrivial bounds for large $q$. Then we focus on the particular case $q=2$, which is more intricate. The bounds depend on certain natural restrictions. We also provide families of examples for which the conditions of our bounds are fulfilled. In particular, we completely classify all monomials as argument of the additive character for which our bound is applicable. Moreover, we also show that it is applicable for a large family of rational functions, which includes all reciprocal monomials.

Recommendations

• Character sums in finite fields
• On lower bounds for incomplete character sums over finite fields
• On lower estimates of character sums over finite fields
• Character sums over elements of extensions of finite fields with restricted coordinates
• An estimate of incomplete mixed character sums

Cites work

• scientific article; zbMATH DE number 1594313 (Why is no real title available?)
• scientific article; zbMATH DE number 6497987 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 2121181 (Why is no real title available?)
• A CLASS OF INCOMPLETE CHARACTER SUMS
• Applied number theory
• Efficient congruencing in ellipsephic sets: the general case
• Mixed exponential sums over finite fields
• Multiplicative character sums and products of sparse integers in residue classes
• Normality of the Thue-Morse function for finite fields along polynomial values
• On RSA moduli with almost half of the bits prescribed
• On a problem of Gelfond: the sum of digits of prime numbers
• On the digital representation of integers with bounded prime factors
• On the distribution of the Rudin-Shapiro function for finite fields
• On the squares in the set of elements of a finite field with constraints on the coefficients of its basis expansion
• On the sum of digits of special sequences in finite fields
• Polynomial values and generators with missing digits in finite fields
• Polynomial values in affine subspaces of finite fields
• Prescribing digits in finite fields
• Prescribing the binary digits of primes
• Prescribing the binary digits of primes. II
• Prescribing the binary digits of squarefree numbers and quadratic residues
• Prime numbers in two bases
• Prime numbers with a positive proportion of preassigned digits
• Primes and polynomials with restricted digits
• Primes from sums of two squares and missing digits
• Primes with restricted digits
• The Ternary Goldbach Problem with a Missing Digit and Other Primes of Special Types
• The generalized divisor problem with natural numbers of a special form
• The sum of digits function in finite fields
• The sum of digits of squares
• Waring's Problem Restricted by a System of Sum of Digits Congruences
• Waring's problem in natural numbers of special form
• Waring's problem with digital restrictions

Cited in

(1)

• Character sums over elements of extensions of finite fields with restricted coordinates

This page was built for publication: Character sums over sparse elements of finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203676)