On the complexity of exact counting of dynamically irreducible polynomials
From MaRDI portal
Publication:2284970
DOI10.1016/j.jsc.2019.06.001zbMath1479.11206arXiv1706.04392MaRDI QIDQ2284970
László Mérai, Igor E. Shparlinski, Domingo Gómez-Pérez
Publication date: 15 January 2020
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.04392
irreducible polynomials; composition of polynomials; stable quadratic polynomials; dynamically irreducible polynomials
68W30: Symbolic computation and algebraic computation
11Y16: Number-theoretic algorithms; complexity
11T06: Polynomials over finite fields
Related Items
Cites Work
- Unnamed Item
- Stable polynomials over finite fields
- Settled polynomials over finite fields
- The density of prime divisors in the arithmetic dynamics of quadratic polynomials
- On the length of critical orbits of stable quadratic polynomials
- Irreducibility of the iterates of a quadratic polynomial over a field
- Irreducible compositions of degree two polynomials over finite fields have regular structure
- On Sets of Irreducible Polynomials Closed by Composition
- Stabilité des polynômes