On Sets of Irreducible Polynomials Closed by Composition

DOI10.1007/978-3-319-55227-9_6zbMath1409.11123arXiv1604.05223OpenAlexW2338939684MaRDI QIDQ5267794

Giacomo Micheli, Reto Schnyder, Andrea Ferraguti

Publication date: 13 June 2017

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.05223

zbMATH Keywords

finite fieldsirreducible polynomialssemigroups of irreducible polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Related Items (7)

Irreducible polynomials in quadratic semigroups ⋮ Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation ⋮ The set of stable primes for polynomial sequences with large Galois group ⋮ On the complexity of exact counting of dynamically irreducible polynomials ⋮ On algebraic integers of bounded house and preperiodicity in polynomial semigroup dynamics ⋮ Irreducible polynomials over finite fields produced by composition of quadratics ⋮ Current trends and open problems in arithmetic dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence of infinite, non-trivial \(F\)-sets
• An estimate on the number of stable quadratic polynomials
• Algebraic dynamics of polynomial maps on the algebraic closure of a finite field. I
• Algebraic dynamics of polynomial maps on the algebraic closure of a finite field. II
• An iterative construction of irreducible polynomials reducible modulo every prime
• Handbook of Finite Fields
• ON STABLE QUADRATIC POLYNOMIALS
• Settled polynomials over finite fields
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• On the length of critical orbits of stable quadratic polynomials
• Irreducible trinomials over finite fields
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic

This page was built for publication: On Sets of Irreducible Polynomials Closed by Composition