On the Complexity of Exact Counting of Dynamically Irreducible Polynomials

Domingo G\'omez-P\'erez; Igor E. Shparlinski; L\'aszl\'o M\'erai

arxiv: 1706.04392 · v2 · pith:IFTZS2Q4new · submitted 2017-06-14 · 🧮 math.NT · cs.SC· math.DS

On the Complexity of Exact Counting of Dynamically Irreducible Polynomials

Domingo G\'omez-P\'erez , L\'aszl\'o M\'erai , Igor E. Shparlinski This is my paper

classification 🧮 math.NT cs.SCmath.DS

keywords irreduciblepolynomialsalgorithmcomplexitycompositionscountingdynamicallyefficient

0 comments

read the original 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.

This paper has not been read by Pith yet.

On the Complexity of Exact Counting of Dynamically Irreducible Polynomials

discussion (0)