On the Complexity of Exact Counting of Dynamically Irreducible Polynomials
Number Theory
2018-11-21 v2 Symbolic Computation
Dynamical Systems
Abstract
We give an efficient algorithm to enumerate all sets of quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
Keywords
Cite
@article{arxiv.1706.04392,
title = {On the Complexity of Exact Counting of Dynamically Irreducible Polynomials},
author = {Domingo Gómez-Pérez and László Mérai and Igor E. Shparlinski},
journal= {arXiv preprint arXiv:1706.04392},
year = {2018}
}