Character sums over sparse elements of finite fields
From MaRDI portal
Publication:6203676
DOI10.1112/blms.13008arXiv2211.08452OpenAlexW4392191497MaRDI QIDQ6203676
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)
Full work available at URL: https://arxiv.org/abs/2211.08452
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplicative character sums and products of sparse integers in residue classes
- The sum of digits of squares
- Prime numbers in two bases
- Waring's problem with digital restrictions
- On a problem of Gelfond: the sum of digits of prime numbers
- On RSA moduli with almost half of the bits prescribed
- Prescribing 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
- Prescribing the binary digits of primes
- Normality of the Thue-Morse function for finite fields along polynomial values
- Polynomial values in affine subspaces of finite fields
- Prescribing the binary digits of primes. II
- Polynomial values and generators with missing digits in finite fields
- On the squares in the set of elements of a finite field with constraints on the coefficients of its basis expansion
- Primes with restricted digits
- The sum of digits function in finite fields
- A CLASS OF INCOMPLETE CHARACTER SUMS
- Applied Number Theory
- Waring’s problem in natural numbers of special form
- The generalized divisor problem with natural numbers of a special form
- Mixed exponential sums over finite fields
- Primes and Polynomials With Restricted Digits
- Primes from sums of two squares and missing digits
- Prime numbers with a positive proportion of preassigned digits
- On the distribution of the Rudin-Shapiro function for finite fields
- Prescribing the binary digits of squarefree numbers and quadratic residues
- Waring's Problem Restricted by a System of Sum of Digits Congruences
- Efficient congruencing in ellipsephic sets: the general case
- The Ternary Goldbach Problem with a Missing Digit and Other Primes of Special Types
This page was built for publication: Character sums over sparse elements of finite fields