Dynamical irreducibility of polynomials modulo primes
From MaRDI portal
Abstract: For a class of polynomials , which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set of primes such that all iterations of are irreducible modulo is of relative density zero. Furthermore, we give an explicit bound on the rate of the decay of the density of such primes in an interval as . For this class of polynomials this gives a more precise version of a recent result of A. Ferraguti (2018), which applies to arbitrary polynomials but requires a certain assumption about their Galois group. Furthermore, under the Generalised Riemann Hypothesis we obtain a stronger bound on this density.
Recommendations
- On the complexity of exact counting of dynamically irreducible polynomials
- Irreducibility of iterates of post-critically finite quadratic polynomials over \(\mathbb{Q}\)
- Irreducibility of the iterates of a quadratic polynomial over a field
- An iterative construction of irreducible polynomials reducible modulo every prime
- Eventually stable quadratic polynomials over \(\mathbb{Q}\)
Cites work
- scientific article; zbMATH DE number 437613 (Why is no real title available?)
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- scientific article; zbMATH DE number 1267537 (Why is no real title available?)
- scientific article; zbMATH DE number 1047203 (Why is no real title available?)
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- scientific article; zbMATH DE number 2247920 (Why is no real title available?)
- An estimate on the number of stable quadratic polynomials
- An iterative construction of irreducible polynomials reducible modulo every prime
- Current trends and open problems in arithmetic dynamics
- Effective results for hyper- and superelliptic equations over number fields
- Errata to: ``Settled polynomials over finite fields
- Introduction to analytic and probabilistic number theory. Transl. from the 3rd French edition by Patrick D. F. Ion
- Irreducibility of the iterates of a quadratic polynomial over a field
- Irreducible polynomials over finite fields produced by composition of quadratics
- Modern computer algebra
- Multiplicative number theory. I. Classical theory
- Quadratic non-residues in short intervals
- Settled polynomials over finite fields
- Stabilité des polynômes
- Stable polynomials over finite fields
- The arithmetic of dynamical systems
- The density of prime divisors in the arithmetic dynamics of quadratic polynomials
- The set of stable primes for polynomial sequences with large Galois group
- The square sieve and consecutive square-free numbers
Cited in
(11)- The density of prime divisors in the arithmetic dynamics of quadratic polynomials
- Some applications of dynamical Belyi polynomials
- The density of primes in orbits of \(z^d+c\)
- On the complexity of exact counting of dynamically irreducible polynomials
- MFO-RIMS tandem workshop: Arithmetic homotopy and Galois theory. Abstracts from the MFO-RIMS tandem workshop held September 24--29, 2023
- The set of stable primes for polynomial sequences with large Galois group
- Primitive divisors, dynamical Zsigmondy sets, and Vojta's conjecture
- On stable quadratic polynomials
- Dynamically distinguishing polynomials
- Stable polynomials over finite fields
- Sparsity of stable primes for dynamical sequences
This page was built for publication: Dynamical irreducibility of polynomials modulo primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043070)