2018
DOI: 10.1090/tran/7229
|View full text |Cite
|
Sign up to set email alerts
|

Iterates of generic polynomials and generic rational functions

Abstract: Abstract. In 1985, Odoni showed that in characteristic 0 the Galois group of the n-th iterate of the generic polynomial with degree d is as large as possible. That is, he showed that this Galois group is the n-th wreath power of the symmetric group S d . We generalize this result to positive characteristic, as well as to the generic rational function. These results can be applied to prove certain density results in number theory, two of which are presented here. This work was partially completed by the late R.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
8
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(8 citation statements)
references
References 19 publications
0
8
0
Order By: Relevance
“…(See also [5,9,10].) More precisely, after counting elements of E n that fix a leaf of the tree T n , we have the following arithmetic application.…”
mentioning
confidence: 99%
“…(See also [5,9,10].) More precisely, after counting elements of E n that fix a leaf of the tree T n , we have the following arithmetic application.…”
mentioning
confidence: 99%
“…, s d−1 are transcendentals over F , then the generic monic polynomial G(x) = x d + s d−1 x d−1 + · · · + s 0 ∈ E[x] defined over the function field E satisfies Gal(E(G −n (0))/E) ∼ = [S d ] n . In [6], the second author showed that this result also holds for fields of characteristic p, except in the case p = d = 2. It follows from Hilbert's Irreducibility Theorem that if F = Q, or more generally if F is any Hilbertian field, then for any fixed n 0, there are infinitely many polynomials f (x) ∈ F (x) for which Gal(F (f −n (x 0 ))/F ) ∼ = [S d ] n .…”
Section: Introductionmentioning
confidence: 86%
“…We now set forth a criterion ensuring maximality of the extension Kn/Kn1. The ideas are inspired by the proof of [, Theorem 3.1]. Proposition Assume the hypotheses and notation of Proposition ; suppose, moreover, that pnφmfalse(afalse) for all 1mn1, and that for all critical points ba of φ(x) and 1mn, we have pnφmfalse(bfalse).…”
Section: Ramification Behavior In Extensions Defined By Trinomialsmentioning
confidence: 99%