Polynomial values and generators with missing digits in finite fields
Let \(q=p^r\) and \(\{a_1,\ldots,a_r\}\) be a fixed basis of \(\mathbb{F}_q\) over \(\mathbb{F}_p\). Each \(x\in \mathbb{F}_q\) admits a unique representation as \(x=\sum_{j=1}^r c_j a_j\) with \(c_j \in \mathbb{F}_p\) (called ``the digits). The aim of the present paper is to study the set of quadratic residues, and that of polynomial values \(f(x)\in \mathbb{F}_q[x]\) whose ``digits lie in some fixed, predefined set \(\mathcal{D}\), thus with certain ``missing digits. The estimates are studied in relation to the size of \(\mathcal{D}\). The first result says that if \(|\mathcal{D}|\) is close to \(p\) then, as one might expect, half of the restricted elements of \(\mathbb{F}_q\) are quadratic residues. A further estimate is given when \(\mathcal{D}\) is a set of consecutive integers. The result for \(f(x)\) (a polynomial of degree at least 2) uses the Weil bound and applies when \(|\mathcal{D}|\) is large. Finally, the analogous problem is studied for \(f(g)\), where \(g\) runs through the generators of \(\mathbb{F}_q\). The main techniques used in the paper are exponential sum estimates and character sums. The paper concludes with an extensive list of references.
- 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
- Almost primes whose expansion in base \(r\) misses some digits
- Arithmetic properties of integers with missing digits: distribution in residue classes
- Arithmetic properties of numbers with restricted digits
- Arithmetics properties of substitutions and infinite automata
- Character sums over integers with restricted g-ary digits
- CONGRUENCES DE SOMMES DE CHIFFRES DE VALEURS POLYNOMIALES
- Equations in finite fields with restricted solution sets. I: Character sums
- Graphes connexes représentation des entiers et équirepartition
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3091928 (Why is no real title available?)
- Multiplicative properties of the Thue-Morse sequence
- On a problem of Gelfond: the sum of digits of prime numbers
- On arithmetic properties of integers with missing digits. I: Distribution in residue classes
- On arithmetic properties of integers with missing digits. II: Prime factors
- On the number of prime factors of integers characterized by digit properties
- On the uniform distribution modulo one of some subsequences of polynomial sequences
- On the uniform distribution modulo one of subsequences of polynomial sequences. II
- Prime number theorem for digital functions
- Primes with an average sum of digits
- Sums of digits and almost primes
- Sums of digits of multiples of integers
- The sum of digits function in finite fields
- The sum of digits of polynomial values in arithmetic progressions
- The sum of digits of squares
- The sum-of-digits function of polynomial sequences
- The Sum-of-Digits Function of Squares
- Weyl sums over integers with affine digit restrictions
- Zero-density sets containing integers with at most two prime factors
- Trace of products in finite fields
- Prescribing digits in finite fields
- On the sum of digits of special sequences in finite fields
- Arithmetic constraints of polynomial maps through discrete logarithms
- Normality of the Thue-Morse function for finite fields along polynomial values
- Pseudorandom sequences derived from automatic sequences
- On primitive elements of finite fields avoiding affine hyperplanes
- On the squares in the set of elements of a finite field with constraints on the coefficients of its basis expansion
- Expansions of elements written with respect to a quadratic generating polynomial
- On the distribution of the Rudin-Shapiro function for finite fields
- On squares in special sets of finite fields
- Trace of products in finite fields from a combinatorial point of view
- Prescribing the binary digits of squarefree numbers and quadratic residues
- Irreducible polynomials over a finite field with restricted coefficients
- Character sums over sparse elements of finite fields
- Distribution of integers with digit restrictions via Markov chains
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)
