Skip to Main content Skip to Navigation
Conference papers

Megamaps: Construction and Examples

Abstract : We consider the usual model of hypermaps or, equivalently, bipartite maps, represented by pairs of permutations that act transitively on a set of edges E. The specific feature of our construction is the fact that the elements of E are themselves (or are labelled by) rather complicated combinatorial objects, namely, the 4-constellations, while the permutations defining the hypermap originate from an action of the Hurwitz braid group on these 4-constellations.The motivation for the whole construction is the combinatorial representation of the parameter space of the ramified coverings of the Riemann sphere having four ramification points.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 6, 2015 - 3:02:11 PM
Last modification on : Saturday, June 25, 2022 - 10:35:51 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 10:04:46 AM


Publisher files allowed on an open archive




Alexander Zvonkin. Megamaps: Construction and Examples. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.329-340, ⟨10.46298/dmtcs.2284⟩. ⟨hal-01182964⟩



Record views


Files downloads