An uncertainty principle for function fields
Let \(\mathbb{F}_q(t)\) be the set of polynomials over a finite field \(\mathbb{F}_q\). The problems related to the uncertainty principle phenomenon in \(\mathbb{F}_q(t)\) are considered. The first main assertion shows that arithmetic sequences on \(\mathbb{F}_q(t)\) must fail to be well distributed uniformly in arithmetic progressions to large moduli. The second result establishes that arithmetic sequences must be poorly distributed either in short intervals, or in arithmetic progressions to much smaller moduli. The third and fourth assertions are dealt with the existence of irregularities in the distribution of primes, in both short intervals and in arithmetics progressions to large moduli. For instance, the following assertion is proved in the paper. Assume that \(z,D\) and \(u\) are positive integers satisfying: \(z\geq z_0 \), \(D\geq 5q^z \), and \( B<u/z\ll \text{e}^{2z/3}/z\) for a certain absolute constants \(z_0\) and \(B\). Let, in addition, \(u/z<2^{2z/3}/z\) if \(q=2\). Then there exists a monic polynomial \(f_+\in\mathbb{F}_q(t)\) of degree \(D\) such that \[ \sum\limits_{\text{deg}\,S\leq u\;\atop f_+\,+\,S \;\text{ is prime}} 1\geq\frac{q^{u+1}}{D}\left(1+\exp\left\{-\frac{u}{z}\left(\log\frac{u}{z}+\log\log\frac{u}{z}+O(1)\right)\right\}\right) \] with an absolute constant in \(O(1)\). To obtain his results author of the paper follows mainly the methods of \textit{A. Granville} and \textit{K. Soundararajan} [Ann. Math. (2) 165, No. 2, 593--635 (2007; Zbl 1139.11040)].
- Répartition modulo 1 dans un corps de séries formelles sur un corps fini
- Irregularities in the distributions of primes in function fields
- On the prime ideal theorem and irregularities in the distribution of primes
- Counting irreducible polynomials over finite fields
- The covariance of almost-primes in \(\mathbb {F}_{q}[T]\)
- The Distribution of Solutions to Equations Over Finite Fields
- Arithmetic properties of polynomial specializations over finite fields
- Applications of the large sieve inequality for \(\mathbb{F}_q[T]\)
- Counting monic irreducible polynomials \(P\) in \(\mathbb F_q[X]\) for which order of \(X\pmod P\) is odd
- An explicit approach to hypothesis H for polynomials over a finite field.
- An uncertainty principle for arithmetic sequences
- Further Arithmetical Functions in Finite Fields
- scientific article; zbMATH DE number 1716471 (Why is no real title available?)
- scientific article; zbMATH DE number 3843872 (Why is no real title available?)
- scientific article; zbMATH DE number 702026 (Why is no real title available?)
- scientific article; zbMATH DE number 849973 (Why is no real title available?)
- scientific article; zbMATH DE number 3397622 (Why is no real title available?)
- Irregularities in the distributions of primes in function fields
- Prime specialization in genus 0
- Primes in short intervals
- Simultaneous prime specializations of polynomials over finite fields
- THE DISTRIBUTION OF PRIME NUMBERS
This page was built for publication: An uncertainty principle for function fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q538160)
