Character sums over sparse elements of finite fields

DOI10.1112/BLMS.13008arXiv2211.08452OpenAlexW4392191497MaRDI QIDQ6203676FDOQ6203676

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

Publication date: 6 April 2024

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

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.

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

Mathematics Subject Classification ID

Exponential sums (11T23)

Cites Work

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

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)