English
Related papers

Related papers: Dessins d'enfants and Hubbard Trees

200 papers

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…

Number Theory · Mathematics 2007-05-23 Fedor Pakovich

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…

Number Theory · Mathematics 2020-08-26 Andrea Ferraguti , Carlo Pagano

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…

Dynamical Systems · Mathematics 2009-09-25 Alfredo Poirier

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…

Number Theory · Mathematics 2017-12-22 Robert L. Benedetto , Xander Faber , Benjamin Hutz , Jamie Juul , Yu Yasufuku

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…

Group Theory · Mathematics 2014-08-21 Pierre Guillot

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).

Dynamical Systems · Mathematics 2009-09-25 Alfredo Poirier

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…

Group Theory · Mathematics 2013-09-23 Gareth A. Jones

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…

Number Theory · Mathematics 2007-05-23 Nigel Boston

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…

Complex Variables · Mathematics 2020-07-09 Christopher J. Bishop

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…

Geometric Topology · Mathematics 2021-05-03 Yasmina Atarihuana , Juan García , Rubén A. Hidalgo , Saúl Quispe , Camilo Ramírez Maluendas

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…

Mathematical Physics · Physics 2019-05-28 Jian Zhou

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…

Dynamical Systems · Mathematics 2025-09-01 David Pfrang , Michael Rothgang , Dierk Schleicher

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…

Number Theory · Mathematics 2020-03-05 Borys Kadets

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…

Combinatorics · Mathematics 2023-07-19 Devendra Tiwari

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…

Quantum Physics · Physics 2015-09-07 Michel Planat , Alain Giorgetti , Frédéric Holweck , Metod Saniga

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…

Number Theory · Mathematics 2024-04-08 Robert L. Benedetto , William DeGroot , Xinyu Ni , Jesse Seid , Annie Wei , Samantha Winton

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…

Group Theory · Mathematics 2018-10-16 Gareth A. Jones

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…

Dynamical Systems · Mathematics 2024-05-27 Mariam Al-Hawaj

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…

Group Theory · Mathematics 2022-06-09 Alejandro Cañas , Ruben A. Hidalgo , Francisco Javier Turiel , Antonio Viruel

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…

Dynamical Systems · Mathematics 2021-11-25 James Belk , Justin Lanier , Dan Margalit , Rebecca R. Winarski
‹ Prev 1 2 3 10 Next ›