Diophantine approximation and primitive prime divisors in random iterations
From MaRDI portal
Publication:6180237
DOI10.4064/aa230303-12-8MaRDI QIDQ6180237
Publication date: 19 January 2024
Published in: Acta Arithmetica (Search for Journal in Brave)
Approximation to algebraic numbers (11J68) Arithmetic and non-Archimedean dynamical systems involving polynomial and rational maps (37P05) Height functions; Green functions; invariant measures in arithmetic and non-Archimedean dynamical systems (37P30) Random iteration (37H12)
Cites Work
- Unnamed Item
- Unnamed Item
- Integer points, diophantine approximation, and iteration of rational maps
- Dynamical height growth: left, right, and total orbits
- Zsigmondy's theorem and primitive divisors of the Lucas and Lehmer sequences in polynomial rings
- Stochastic canonical heights
- ABC implies primitive prime divisors in arithmetic dynamics
- Primitive Prime Divisors in Zero Orbits of Polynomials
- Function field analogues of Bang--Zsigmondy\'s theorem and Feit\'s theorem
- Prime factors of dynamical sequences
- Primitive Prime Divisors in the Critical Orbit of zd+c
- Primitive divisors in arithmetic dynamics
- The Arithmetic of Elliptic Curves
- Average Zsigmondy sets, dynamical Galois groups, and the Kodaira-Spencer map
- The đŽđ”đ¶-Conjecture implies uniform bounds on dynamical Zsigmondy sets
- Primitive prime divisors in the critical orbits of one-parameter families of rational polynomials
- Canonical Heights for Random Iterations in Certain Varieties
This page was built for publication: Diophantine approximation and primitive prime divisors in random iterations