Related papers: Dessins d'enfants and Hubbard Trees
In this paper we study an action of the absolute Galois group $\Gamma$ on bicolored plane trees induced by the action of $\Gamma$ on equivalence classes of conservative polynomials which are the simplest example of postcritically finite…
In this paper, we prove several results on finitely generated dynamical Galois groups attached to quadratic polynomials. First we show that, over global fields, quadratic post-critically finite polynomials are precisely those having an…
The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…
We give a complete description of the arboreal Galois representation of a certain postcritically finite cubic polynomial over a large class of number fields and for a large class of basepoints. This is the first such example that is not…
We give an account of the theory of dessins d'enfants which is both elementary and self-contained. We describe the equivalence of many categories (graphs embedded nicely on surfaces, finite sets with certain permutations, certain field…
We provide an effective classification of postcritically finite polynomials as dynamical systems by means of Hubbard Trees. This can be viewed as an application of the results developed in part 1 (Stony Brook IMS 1993/5).
Dessins d'enfants are combinatorial structures on compact Riemann surfaces defined over algebraic number fields, and regular dessins are the most symmetric of them. If G is a finite group, there are only finitely many regular dessins with…
Much work has gone into matrix representations of Galois groups, but there is a whole new class of naturally occurring representations that have as yet gone almost unnoticed. In fact, it is well-known in various areas of mathematics that…
We show that any compact, connected set $K$ in the plane can be approximated by the critical points of a polynomial with two critical values. Equivalently, $K$ can be approximated in the Hausdorff metric by a true tree in the sense of…
The classical theory of dessin d'enfants, which are bipartite maps on compact orientable surfaces, are combinatorial objects used to study branched covers between compact Riemann surfaces and the absolute Galois group of the field of…
In this paper we show that counting Grothendieck's dessins d'enfants is universal in the sense that some other enumerative problems are either special cases or directly related to it. Such results provide concrete examples that support a…
We extend the concept of a Hubbard tree, well established and useful in the theory of polynomial dynamics, to the dynamics of transcendental entire functions. We show that Hubbard trees in the strict traditional sense, as invariant compact…
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…
In this work we will construct bipartite graphs, famously known as Dessin d'enfant, corresponding to finite index subgroups of Hecke triangle groups $(2, q, \infty )$. Then using a results of \cite{ll} we shall show the correspondences…
We point out an explicit connection between graphs drawn on compact Riemann surfaces defined over the field $\bar{\mathbb{Q}}$ of algebraic numbers --- so-called Grothendieck's {\it dessins d'enfants} --- and a wealth of distinguished…
Let $K$ be a field, and let $f\in K(z)$ be a rational function of degree $d\geq 2$. The Galois group of the field extension generated by the preimages of $x_0\in K$ under all iterates of $f$ naturally embeds in the automorphism group of an…
It is shown that in various categories, including many consisting of maps or hypermaps, oriented or unoriented, of a given hyperbolic type, every countable group $A$ is isomorphic to the automorphism group of uncountably many non-isomorphic…
In this project, we develop a new connection between the dynamics of quadratic polynomials on the complex plane and the dynamics of homeomorphisms of surfaces. In particular, given a quadratic polynomial, we investigate whether one can…
It is known that every finite group can be represented as the full group of automorphisms of a suitable compact dessin d'enfant. In this paper, we give a constructive and easy proof that the same holds for any countable group by considering…
We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…