Mathematics > Number Theory
[Submitted on 28 May 2018 (v1), last revised 23 Feb 2019 (this version, v2)]
Title:A finiteness theorem for specializations of dynatomic polynomials
View PDFAbstract:Let $t$ and $x$ be indeterminates, let $\phi(x)=x^2+t\in\mathbb Q(t)[x]$, and for every positive integer $n$ let $\Phi_n(t,x)$ denote the $n^{\text{th}}$ dynatomic polynomial of $\phi$. Let $G_n$ be the Galois group of $\Phi_n$ over the function field $\mathbb Q(t)$, and for $c\in\mathbb Q$ let $G_{n,c}$ be the Galois group of the specialized polynomial $\Phi_n(c,x)$. It follows from Hilbert's irreducibility theorem that for fixed $n$ we have $G_n\cong G_{n,c}$ for every $c$ outside a thin set $E_n\subset\mathbb Q$. By earlier work of Morton (for $n=3$) and the present author (for $n=4$), it is known that $E_n$ is infinite if $n\le 4$. In contrast, we show here that $E_n$ is finite if $n\in\{5,6,7,9\}$. As an application of this result we show that, for these values of $n$, the following holds with at most finitely many exceptions: for every $c\in\mathbb Q$, more than $81\%$ of prime numbers $p$ have the property that the polynomial $x^2+c$ does not have a point of period $n$ in the $p$-adic field $\mathbb Q_p$.
Submission history
From: David Krumm [view email][v1] Mon, 28 May 2018 19:55:27 UTC (128 KB)
[v2] Sat, 23 Feb 2019 22:09:37 UTC (129 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.