On sets of irreducible polynomials closed by composition

DOI10.1007/978-3-319-55227-9_6MaRDI QIDQ5267794zbMATH OpenOpenAlexFDO

Authors Andrea Ferraguti, Giacomo Micheli, R. Schnyder

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)

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.

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

Cites work

• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• scientific article; zbMATH DE number 1222349 (Why is no real title available?)
• scientific article; zbMATH DE number 1008373 (Why is no real title available?)
• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• 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 estimate on the number of stable quadratic polynomials
• An iterative construction of irreducible polynomials reducible modulo every prime
• Handbook of finite fields
• Irreducible trinomials over finite fields
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• On stable quadratic polynomials
• On the existence of infinite, non-trivial \(F\)-sets
• On the length of critical orbits of stable quadratic polynomials
• Settled polynomials over finite fields

Cited in

(9)

• The set of stable primes for polynomial sequences with large Galois group
• Irreducible compositions of degree two polynomials over finite fields have regular structure
• 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
• scientific article; zbMATH DE number 5693568 (Why is no real title available?)
• 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)