{"paper":{"title":"Introduction to Iterated Monodromy Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"S\\'ebastien Godillon","submitted_at":"2014-03-04T18:59:54Z","abstract_excerpt":"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.\n  These notes attempt to introduce this theory for those who are familiar with holomorphic dynamics but not with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0899","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}