Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. A simple formula for ...
Conference paper

A simple formula for bipartite and quasi-bipartite maps with boundaries

Gwendal Collet (1), Eric Fusy (1)
(1) Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2011
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
Proceedings
DOI
10.46298/dmtcs.3067
License
https://about.hal.science/hal-authorisation-v1
European Commission
208471
Combinatorial methods, from enumerative topology to random discrete structures and compact data representations.
Indicators
503
Views
799
Downloads

A simple formula for bipartite and quasi-bipartite maps with boundaries

Gwendal Collet (1), Eric Fusy (1)
(1) Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract
English
We obtain a very simple formula for the generating function of bipartite (resp. quasi-bipartite) planar maps with boundaries (holes) of prescribed lengths, which generalizes certain expressions obtained by Eynard in a book to appear. The formula is derived from a bijection due to Bouttier, Di Francesco and Guitter combined with a process (reminiscent of a construction of Pitman) of aggregating connected components of a forest into a single tree.
French
Nous obtenons une formule très simple pour la série génératrice des cartes biparties ayant des bords (trous) de tailles fixées, généralisant certaines expressions obtenues par Eynard dans un livre à paraître. Nous obtenons la formule à partir d'une bijection due à Bouttier, Di Francesco et Guitter, combinée avec un processus (dans l'esprit d'une construction due à Pitman) pour agréger les composantes connexes d'une forêt en un unique arbre.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • bijections
  • planar maps
  • enumeration
Cited by

Source: OpenCitations

  • A Simple Formula for the Series of Constellations and Quasi-Constellations with Boundaries

    The Electronic Journal of Combinatorics

    Authors : Gwendal Collet, Éric Fusy ORCID

    Journal reference : Volume 21, 2014, pp.

    DOI : 10.37236/3472
  • Limit laws of planar maps with prescribed vertex degrees

    arXiv (Cornell University)

    Authors : G. Collet, M. Drmota, L. D. Klausner

    Journal reference : Volume 28, 2019, pp. 519-541

    DOI : 10.1017/s0963548318000573
Preview
Loading PDF preview...