2012
DOI: 10.1016/j.jalgebra.2012.05.020
|View full text |Cite
|
Sign up to set email alerts
|

An iterative construction of irreducible polynomials reducible modulo every prime

Abstract: We give a method of constructing polynomials of arbitrarily large degree irreducible over a

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
38
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 24 publications
(38 citation statements)
references
References 21 publications
0
38
0
Order By: Relevance
“…In this paper we specialize on irreducibility questions regarding compositional semigroups of polynomials. This kind of question has been addressed in the specific case of semigroups generated by a single quadratic polynomial, see for example in [6,5,11,10], for analogous results related to additive polynomials, see [14,15]. It is worth mentioning that one of these results [11,Lemma 2.5] has been recently used in [16] by the first and the second author of the present paper to prove [12,Conjecture 1.2].…”
Section: Introductionmentioning
confidence: 85%
See 1 more Smart Citation
“…In this paper we specialize on irreducibility questions regarding compositional semigroups of polynomials. This kind of question has been addressed in the specific case of semigroups generated by a single quadratic polynomial, see for example in [6,5,11,10], for analogous results related to additive polynomials, see [14,15]. It is worth mentioning that one of these results [11,Lemma 2.5] has been recently used in [16] by the first and the second author of the present paper to prove [12,Conjecture 1.2].…”
Section: Introductionmentioning
confidence: 85%
“…Since irreducible polynomials play a fundamental role in applications and in the whole theory of finite fields (see for example [1,2,3,4,5,6]), related questions have a long history (see for example [7,8,9,10,11,12,13]). In this paper we specialize on irreducibility questions regarding compositional semigroups of polynomials.…”
Section: Introductionmentioning
confidence: 99%
“…It has been of great interest in recent years the study of irreducible polynomials which can be written as composition of degree two polynomials (see for example [1,2,6,8,9,11,13,14,16,17,18]). Such polynomials are also used in other contexts, see for example Rafe Jones' construction of irreducible polynomials reducible modulo every prime [16] or the proof of [3, Conjecture 1.2] in [5]. In this paper we explain how the theory of this class of polynomials completely fits in a general context which allows the use of powerful machinery coming from the theory of finite automata (in characteristic different from 2).…”
Section: Introductionmentioning
confidence: 99%
“…As a specific example, Jones[122, Conjecture 6.3] has conjectured that x 2 + 1 is stable over F p if and only if p = 3, i.e., for f (x) = x 2 + 1, the set (19.3) is {3}. Ferraguti[76] has shown that under some Galois-theoretic assumptions, the set of stable primes (19.3) has density zero.…”
mentioning
confidence: 99%