Prescribing digits in finite fields
Consider the finite field \(\mathbb{F}_q\), where \(q=p^r\) with \(r\geq 2\) and \(p\) a prime number, and fix a basis \(\{e_1,\ldots, e_r\}\) of the vector space \(\mathbb{F}_q\) over \(\mathbb{F}_p\). Since every \(x\in \mathbb{F}_q\) has a unique representation \(x=\sum_{j=1}^r c_j e_j\) with \(c_1,\ldots, c_r\in \mathbb{F}_p\), then we may call \(c_j\) the \(j\)-th digit of \(x\). Results here deal with estimates on the number of field elements given that exactly \(k\) of the \(r\) digits are prescribed. More precisely, let \(P\in \mathbb{F}_q[X]\) be a polynomial of degree \(n\), where \(p\nmid n\), and let \(J\subseteq \{1,\ldots, r\}\) with \(|J|=k\) and \(\alpha=(\alpha_j)_{j\in J}\in (\mathbb{F}_p)^k\). Define \(\mathcal{F}_q(P,k,J,\alpha)\) to be the set of all \(x\in \mathbb{F}_q\) such that the \(j\)-th digit of \(P(x)\) equals \(\alpha_j\) for each \(j\in J\). Then (Theorem 1.1) \[ \left| \; |\mathcal{F}_q(P,k,J,\alpha)| - \frac{q}{p^k}\right| \leq \frac{p^{k}-1}{p^k}\, (n-1)\, \sqrt q\; . \] In particular (Corollary 1.2) for up to half of prescribed digits, an asymptotic result is obtained as \(p^r\to\infty\), where \[ |\mathcal{F}_{p^r}(P,k,J,\alpha)| = p^{r-k} \, (1+o(1)) \] uniformly over \(k\leq (\frac{1}{2}-\varepsilon) r\) for any \(\varepsilon >0\). Both Theorem 1.1 and Corollary 1.2 are developed further for the particular case \(P=aX^2\) (Theorem 1.3 and Corollaries 1.4, 1.5) as well as the case in which \(x\) is considered only among the primitive elements of \(\mathbb{F}_q^*\) (Theorem 1.6 and Corollary 1.8).
- CONGRUENCES DE SOMMES DE CHIFFRES DE VALEURS POLYNOMIALES
- Equations over finite fields. An elementary approach
- Handbook of finite fields
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- 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
- Polynomial values and generators with missing 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
- Primes with preassigned digits
- Primes with preassigned digits
- Primes with preassigned digits II
- Primes with restricted digits
- Sums of digits of multiples of integers
- Sur les nombres premiers ayant des chiffres initiaux et finals donnés
- Sur les nombres qui ont des propriétés additives et multiplicatives données
- The sum of digits function in finite fields
- The sum of digits of squares
- 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
- Character sums over affine spaces and applications
- On primitive elements of finite fields avoiding affine hyperplanes
- The sum of digits function in finite fields
- 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
- On the powers of polynomials over a finite field
- Character sums over sparse elements of finite fields
- Distribution of integers with digit restrictions via Markov chains
This page was built for publication: Prescribing digits in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1748133)
