Irreducible compositions of degree two polynomials over finite fields have regular structure

DOI10.1093/qmath/hay015zbMath1442.11163arXiv1701.06040OpenAlexW2581802073WikidataQ56115524 ScholiaQ56115524MaRDI QIDQ4684314

Reto Schnyder, Giacomo Micheli, Andrea Ferraguti

Publication date: 28 September 2018

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

automatafinite fieldsregular languageirreducible polynomials

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Polynomials over finite fields (11T06)

Related Items (8)

Impact of Group Theory in Cryptosystem ⋮ Irreducible polynomials in quadratic semigroups ⋮ Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation ⋮ An equivariant isomorphism theorem for mod $\mathfrak {p}$ reductions of arboreal Galois representations ⋮ On the complexity of exact counting of dynamically irreducible polynomials ⋮ Dynamical height growth: left, right, and total orbits ⋮ Finite orbit points for sets of quadratic polynomials ⋮ Current trends and open problems in arithmetic dynamics

This page was built for publication: Irreducible compositions of degree two polynomials over finite fields have regular structure