Introduction to iterated monodromy groups

DOI10.5802/AFST.1362zbMATH Open1366.37111arXiv1403.0899OpenAlexW2964204581MaRDI QIDQ1950985FDOQ1950985

Authors: Sébastien Godillon 

Publication date: 28 May 2013

Published in: Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI (Search for Journal in Brave)

Abstract: The theory of iterated monodromy groups was developed by Nekrashevych. It is a wonderful example of application of group theory in dynamical systems and, in particular, in holomorphic dynamics. Iterated monodromy groups encode in a computationally efficient way combinatorial information about any dynamical system induced by a post-critically finite branched covering. Their power was illustrated by a solution of the Hubbard Twisted Rabbit Problem given by Bartholdi and Nekrashevych. These notes attempt to introduce this theory for those who are familiar with holomorphic dynamics but not with group theory. The aims are to give all explanations needed to understand the main definition and to provide skills in computing any iterated monodromy group efficiently. Moreover some explicit links between iterated monodromy groups and holomorphic dynamics are detailed. In particular, combinatorial equivalence classes and matings of polynomials are discussed.

Full work available at URL: https://arxiv.org/abs/1403.0899

Recommendations

• Iterated monodromy groups
• Iterated monodromy groups of quadratic polynomials. I.
• On the growth of iterated monodromy groups.
• Iterated monodromy for a two-dimensional map
• Iterated monodromy groups of Chebyshev-like maps on \(\mathbb{C}^n\)

zbMATH Keywords

group theoryholomorphic dynamicsiterated monodromy group

Mathematics Subject Classification ID

Geometric group theory (20F65) Symbolic dynamics (37B10) Combinatorics and topology in relation with holomorphic dynamical systems (37F20)

Cites Work

• A proof of Thurston's topological characterization of rational functions
• A Hurwitz-like classification of Thurston combinatorial classes
• Title not available (Why is that?)
• Combinations of complex dynamical systems
• Classification of groups generated by 3-state automata over a 2-letter alphabet
• Matings of quadratic polynomials
• Title not available (Why is that?)
• Thurston equivalence of topological polynomials
• ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
• Self-similarity and branching in group theory.
• Dessins d'enfants and Hubbard trees.
• An algebraic formulation of Thurston’s combinatorial equivalence

Cited In (11)

• Title not available (Why is that?)
• The Julia set of a post-critically finite endomorphism of \(\mathbb{PC}^2\)
• Combinatorics of polynomials iterations
• On the growth of iterated monodromy groups.
• Iterated monodromy groups of Chebyshev-like maps on \(\mathbb{C}^n\)
• Iterated monodromy for a two-dimensional map
• Iterated monodromy groups
• Blocks of monodromy groups in complex dynamics
• On elementary amenable bounded automata groups
• Iterated monodromy groups of quadratic polynomials. I.
• Geometry and Algebra of the Deltoid Map

This page was built for publication: Introduction to iterated monodromy groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950985)