Related papers: Dessins d'enfants and Hubbard Trees

We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…

Every finite simple group P can be generated by two of its elements. Pairs of generators for P are available in the Atlas of finite group representations as (not neccessarily minimal) permutation representations P. It is unusual but…

Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Belyi maps then implies a bijection between Shabat polynomials…

Dessin d'enfants (French for children's drawings) serve as a unique standpoint of studying classical complex analysis under the lens of combinatorial constructs. A thorough development of the background of this theory is developed with an…

We investigate the profinite completions of a certain family of groups acting on trees. It turns out that for some of the groups considered, the completions coincide with the closures of the groups in the full group of tree automorphisms.…

Consider a number field $K$ and a rational function $f$ of degree greater than 1 over $K$. By taking preimages of $\alpha\in K$ under successive iterates of $f$, an infinite $d$-ary tree $T_\infty$ rooted at $\alpha$ can be constructed. An…

We consider a large class of so-called dynamical Belyi maps and study the Galois groups of iterates of such maps. From the combinatorial invariants of the maps, we construct a useful presentation of their Galois groups as subgroups of…

We show that the Hrushovski-\fraisse limit of certain classes of trees lead to strictly superstable theories of various U-ranks. In fact, for each $ \alpha\in\omega+1\backslash\{0\} $ we introduce a strictly superstable theory of U-rank $…

We develop the foundations of effective ultraproducts of fields and their Galois groups using the methods of computability theory. These computability-theoretic analogs of ultraproducts are called cohesive products, since the role of an…

We extend the theory of countably generated Demushkin groups to Demushkin groups of arbitrary rank. We investigate their algebraic properties and invariants, count their isomorphism classes and study their realization as absolute Galois…

We study finite groups of automorphisms of the $p$-adic open disk. In particular, we generalize results of Green, Matignon and Henrio from cyclic groups of order $p$ to arbitrary finite groups. As an application, we produce a counterexample…

Following the philosophy of arithmetic topology, we describe a point of view which helps look at surfaces and $p$-adic fields in a "uniform way", and show that results on mapping class groups can be extended to this point of view, and thus…

Tree-graded spaces are generalizations of R-trees. They appear as asymptotic cones of groups (when the cones have cut points). Since many questions about endomorphisms and automorphisms of groups, solving equations over groups, studying…

A central conjecture in inverse Galois theory, proposed by D\`{e}bes and Deschamps, asserts that every finite split embedding problem over an arbitrary field can be regularly solved. We give an unconditional proof of a consequence of this…

We study the absolute Galois group by looking for invariants and orbits of its faithful action on Grothendieck's dessins d'enfants. We define a class of functions called Belyi-extending maps, which we use to construct new Galois invariants…

In the mid sixties, A. Grothendieck envisioned a vast generalization of Galois theory to systems of polynomials in several variables, motivic Galois theory, and introduced tannakian categories on this occasion. In characteristic zero,…

The dynamical classification of rational maps is a central concern of holomorphic dynamics. Much progress has been made, especially on the classification of polynomials and some approachable one-parameter families of rational maps; the goal…

Hubbard trees are invariant trees connecting the points of the critical orbits of postcritically finite polynomials. Douady and Hubbard \cite{Orsay} introduced these trees and showed that they encode the essential information of Julia sets…

Let $f(x) \in K(x)$ be a quadratic polynomial where $K$ is a field of characteristic not equal to $2$. The associated arboreal Galois representation of the absolute Galois group of $K$ acts on a regular rooted binary tree. Boston and Jones…

The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the…