Megamaps: Construction and Examples - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2001

Megamaps: Construction and Examples

Résumé

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.
Fichier principal
Vignette du fichier
dmAA0124.pdf (136.79 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01182964 , version 1 (06-08-2015)

Identifiants

Citer

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⟩
115 Consultations
724 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More