On the Complexity of Exact Counting of Dynamically Irreducible\n Polynomials

2017/06/14 by Domingo Gómez‐Pérez, Gómez-Pérez, Domingo, László Mérai +3
Computer Science · Mathematics · #Algorithms and Data Compression #Mathematical Dynamics and Fractals #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.1706.04392

Abstract

We give an efficient algorithm to enumerate all sets of r\≥ 1 quadratic\npolynomials over a finite field, which remain irreducible under iterations and\ncompositions.\n

Related

• Enumerating all the Irreducible Polynomials over Finite Field
• Counting irreducible polynomials with prescribed coefficients over a finite field
• Counting irreducible polynomials over finite fields using the inclusion-exclusion principle
• Generating series for irreducible polynomials over finite fields
• Fast construction of irreducible polynomials over finite fields