On the complexity of exact counting of dynamically irreducible polynomials. (July 2020)

• Record Type: Journal Article
• Authors: Gómez-Pérez, Domingo; Mérai, László; Shparlinski, Igor E.
• Is Part Of: Journal of symbolic computation. Volume 99(2020)
• Page Start: 231
• Page End: 241
• Publication Date: 2020-07
• Subjects: Irreducible polynomials -- Composition of polynomials -- Stable quadratic polynomials -- Dynamically irreducible polynomials; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2019.06.001
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: We give an efficient algorithm to enumerate all sets of r ⩾ 1 quadratic polynomials over a finite field which remain irreducible under iterations and compositions.