arXiv · 2210.10385
Iterated Monodromy Groups of Entire Maps and Dendroid Automata
Abstract
This paper discusses iterated monodromy groups for transcendental functions. We show that for every post-singularly finite entire transcendental function, the iterated monodromy action can be described by bounded activity automata of a special form, called "dendroid automata". In particular, we conclude that the iterated monodromy group of a post-singularly finite entire function is amenable if and only if the monodromy group is.
Explore related subjects
Keep this discovery
Bernhard Reinke. 2022-10-19. Iterated Monodromy Groups of Entire Maps and Dendroid Automata. https://arxiv.org/abs/2210.10385
Cite the original work for its findings. Save a collection to share your selection of sources.