On the Complexity of Exact Counting of Dynamically Irreducible Polynomials
Preprint
Abstract
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Irreducible polynomials over finite fields produced by composition of quadraticsRevista Matemática Iberoamericana, 2019
- Irreducible compositions of degree two polynomials over finite fields have regular structureThe Quarterly Journal of Mathematics, 2018
- Stable polynomials over finite fieldsRevista Matemática Iberoamericana, 2014
- Settled polynomials over finite fieldsProceedings of the American Mathematical Society, 2011
- An estimate on the number of stable quadratic polynomialsFinite Fields and Their Applications, 2010
- On the length of critical orbits of stable quadratic polynomialsProceedings of the American Mathematical Society, 2010
- The density of prime divisors in the arithmetic dynamics of quadratic polynomialsJournal of the London Mathematical Society, 2008
- Irreducibility of the iterates of a quadratic polynomial over a fieldActa Arithmetica, 2000