Polynomial values and generators with missing digits in finite fields
From MaRDI portal
Publication:2339948
DOI10.7169/FACM/2015.52.1.5zbMATH Open1321.11012OpenAlexW1977598163MaRDI QIDQ2339948FDOQ2339948
Authors: Christian Mauduit, Cécile Dartyge, András Sárközy 
Publication date: 14 April 2015
Published in: Functiones et Approximatio. Commentarii Mathematici (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.facm/1426857035
Recommendations
- Values of polynomials over finite fields
- Generators and irreducible polynomials over finite fields
- Polynomials over finite fields with a given value set
- Polynomial values in small subgroups of finite fields
- On the number of values taken by a polynomial over a finite field
- scientific article; zbMATH DE number 1866863
- Value Sets of Polynomials Over Finite Fields
- Value Sets of Some Polynomials Over Finite Fields
- Polynomial values in affine subspaces of finite fields
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the uniform distribution modulo one of subsequences of polynomial sequences. II
- On the uniform distribution modulo one of some subsequences of polynomial sequences
- On arithmetic properties of integers with missing digits. I: Distribution in residue classes
- On arithmetic properties of integers with missing digits. II: Prime factors
- Graphes connexes représentation des entiers et équirepartition
- Character sums over integers with restricted \(g\)-ary digits
- Almost primes whose expansion in base \(r\) misses some digits
- Arithmetic properties of numbers with restricted digits
- On the number of prime factors of integers characterized by digit properties
- Arithmetic properties of integers with missing digits: distribution in residue classes
- Multiplicative properties of the Thue-Morse sequence
- Zero-density sets containing integers with at most two prime factors
- Sums of digits and almost primes
- On a problem of Gelfond: the sum of digits of prime numbers
- The sum of digits of polynomial values in arithmetic progressions
- CONGRUENCES DE SOMMES DE CHIFFRES DE VALEURS POLYNOMIALES
- The sum-of-digits function of polynomial sequences
- The Sum-of-Digits Function of Squares
- The sum of digits of squares
- Primes with an average sum of digits
- Sums of digits of multiples of integers
- Weyl sums over integers with affine digit restrictions
- Arithmetics properties of substitutions and infinite automata
- Prime number theorem for digital functions
- Equations in finite fields with restricted solution sets. I: Character sums
- The sum of digits function in finite fields
Cited In (15)
- On primitive elements of finite fields avoiding affine hyperplanes
- On the distribution of the Rudin-Shapiro function for finite fields
- Normality of the Thue-Morse function for finite fields along polynomial values
- Prescribing digits in finite fields
- Arithmetic constraints of polynomial maps through discrete logarithms
- Prescribing the binary digits of squarefree numbers and quadratic residues
- On the squares in the set of elements of a finite field with constraints on the coefficients of its basis expansion
- Trace of products in finite fields from a combinatorial point of view
- Character sums over sparse elements of finite fields
- Trace of products in finite fields
- On the sum of digits of special sequences in finite fields
- Pseudorandom sequences derived from automatic sequences
- On squares in special sets of finite fields
- Expansions of elements written with respect to a quadratic generating polynomial
- Irreducible polynomials over a finite field with restricted coefficients
This page was built for publication: Polynomial values and generators with missing digits in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339948)
