On the complexity of exact counting of dynamically irreducible polynomials
Authors:
- Domingo Gómez-PérezDGDomingo Gómez-Pérez
- László MéraiLMLászló Mérai
- Igor E. ShparlinskiISIgor E. Shparlinski
- 1 July 2020
- journal article
- research article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 99, 231-241
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Ministerio de Economía y Competitividad (MTM2014-55421-P)
- Austrian Science Fund (P31762, P30405, F5511-N26)
- Australian Research Council (DP180100201, DP170100786)
This publication has 8 references indexed in Scilit:
- 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
- Stabilité des polynômesActa Arithmetica, 2005
- Irreducibility of the iterates of a quadratic polynomial over a fieldActa Arithmetica, 2000