Publication: Galois theory of quadratic rational functions with periodic critical points
Program
KU-Authors
KU Authors
Co-Authors
Ejder, Özlem (57202543413)
Publication Date
Language
Type
Embargo Status
No
Journal Title
Journal ISSN
Volume Title
Alternative Title
Abstract
Given a number field k, and a quadratic rational function f(x)∈k(x), the associated arboreal representation of the absolute Galois group of k is a subgroup of the automorphism group of a regular rooted binary tree. Boston and Jones conjectured that the image of such a representation for f∈Z[x] contains a dense set of settled elements. An automorphism is settled if the number of its orbits on the nth level of the tree remains small as n goes to infinity. In this article, we exhibit many quadratic rational functions whose associated Arboreal Galois groups are not densely settled. These examples arise from quadratic rational functions whose critical points lie in a single periodic orbit. To prove our results, we present a detailed study of the iterated monodromy groups (IMG) of f, which also allows us to provide a negative answer to Jones and Levy's question regarding settled pairs. Furthermore, we study the iterated extension k(f−∞(t)) generated by adjoining to k(t) all roots of fn(x)=t for n≥1 for a parameter t. We call the intersection of k(f−∞(t)) with k¯, the field of constants associated with f. When one of the two critical points of f is the image of the other, we show that the field of constants is contained in the cyclotomic extension of k generated by all 2-power roots of unity. In particular, we prove the conjecture of Ejder, Kara, and Ozman regarding the rational function [Formula presented]. © 2025 Elsevier B.V., All rights reserved.
Source
Publisher
Academic Press Inc.
Subject
Citation
Has Part
Source
Journal of Number Theory
Book Series Title
Edition
DOI
10.1016/j.jnt.2025.08.010
item.page.datauri
Link
Rights
CC BY-NC-ND (Attribution-NonCommercial-NoDerivs)
Copyrights Note
Creative Commons license
Except where otherwised noted, this item's license is described as CC BY-NC-ND (Attribution-NonCommercial-NoDerivs)

