Shabat polynomials and monodromy groups of trees uniquely determined by ramification type

From MaRDI portal
(Redirected from Publication:2424293)



Abstract: A dessin d'enfant, or dessin, is a bicolored graph embedded into a Riemann surface. Acyclic dessins can be described analytically by pre-images of certain polynomials, called Shabat polynomials, and also algebraically by their monodromy groups, that is, the group generated by rotations of edges about black and white vertices. In this paper we investigate the Shabat polynomials and monodromy groups of planar acyclic dessins that are uniquely determined by their passports.


A tree is a graph without any loops. A plane tree is a tree with an embedding into the plane or equivalently a tree together with an ordering of edges emanating from vertices. A map of plane trees preserving this extra structure is called an isomorphism of plane trees. Enumeration problem of isomorphism classes of plane trees as well as their complete list (in terms of their ramification types) is addressed in [\textit{G. Shabat} and \textit{A. Zvonkin}, Contemp. Math. 178, 233--275 (1994; Zbl 0816.05024)]. Building on this, the authors determine the corresponding Belyi maps (called Shabat polynomials) and their monodromy groups.











This page was built for publication: Shabat polynomials and monodromy groups of trees uniquely determined by ramification type

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