Indecomposable Permutations, Hypermaps and Labeled Dyck Paths
| dc.creator | Cori, Robert | |
| dc.date | 2008-12-02 | |
| dc.date.accessioned | 2026-07-07T12:08:35Z | |
| dc.date.available | 2026-07-07T12:08:35Z | |
| dc.description | Hypermaps were introduced as an algebraic tool for the representation of embeddings of graphs on an orientable surface. Recently a bijection was given between hypermaps and indecomposable permutations; this sheds new light on the subject by connecting a hypermap to a simpler object. In this paper, a bijection between indecomposable permutations and labelled Dyck paths is proposed, from which a few enumerative results concerning hypermaps and maps follow. We obtain for instance an inductive formula for the number of hypermaps with n darts, p vertices and q hyper-edges; the latter is also the number of indecomposable permutations of with p cycles and q left-to-right maxima. The distribution of these parameters among all permutations is also considered. | |
| dc.description | 30 pages 4 Figures. submitted | |
| dc.identifier | https://arxiv.org/abs/0812.0440 | |
| dc.identifier | http://arxiv.org/abs/0812.0440 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/209368 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A10; 05A05; 05C10 | |
| dc.title | Indecomposable Permutations, Hypermaps and Labeled Dyck Paths | |
| dc.type | text |