On sets of irreducible polynomials closed by composition

DOI10.1007/978-3-319-55227-9_6zbMATH Open1409.11123arXiv1604.05223OpenAlexW2338939684MaRDI QIDQ5267794FDOQ5267794

Giacomo Micheli, R. Schnyder, Andrea Ferraguti

Publication date: 13 June 2017

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

Abstract: Let $mathcalS$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $mathcalS$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting entirely of irreducible polynomials. The condition we deduce depends on the finite data encoded in a certain graph uniquely determined by the generating set $mathcalS$. Using this machinery we are able both to show examples of semigroups of irreducible polynomials generated by two degree $2$ polynomials and to give some non-existence results for some of these sets in infinitely many prime fields satisfying certain arithmetic conditions.

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

Recommendations

• Irreducible polynomials over finite fields produced by composition of quadratics
• Irreducible compositions of degree two polynomials over finite fields have regular structure
• A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
• On the irreducibility of some composite polynomials
• Irreducible compositions of polynomials over finite fields of even characteristic

zbMATH Keywords

finite fieldsirreducible polynomialssemigroups of irreducible polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Cites Work

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

Cited In (8)

• The set of stable primes for polynomial sequences with large Galois group
• 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
• Irreducible polynomials in quadratic semigroups
• On the complexity of exact counting of dynamically irreducible polynomials
• Title not available (Why is that?)
• Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation

This page was built for publication: On sets of irreducible polynomials closed by composition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267794)