Search arXivSearch

arXiv · 1802.09074

Large arboreal Galois representations

Abstract

Given a field $K$, a polynomial $f \in K[x]$, and a suitable element $t \in K$, the set of preimages of $t$ under the iterates $f^{\circ n}$ carries a natural structure of a $d$-ary tree. We study conditions under which the absolute Galois group of $K$ acts on the tree by the full group of automorphisms. When $K=\mathbb{Q}$ we exhibit examples of polynomials of every even degree with maximal Galois action on the preimage tree, partially affirming a conjecture of Odoni. We also study the case of $K=F(t)$ and $f \in F[x]$ in which the corresponding Galois groups are the monodromy groups of the ramified covers $f^{\circ n}: \mathbb{P}^1_F \to \mathbb{P}^1_F$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Borys Kadets. 2020-03-03. Large arboreal Galois representations. https://doi.org/10.1016/j.jnt.2019.09.021

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT