Bijective counting of tree-rooted maps and shuffles of parenthesis systems

From MaRDI portal
Publication:870065

zbMATH Open1115.05002arXivmath/0601684MaRDI QIDQ870065FDOQ870065

Olivier Bernardi

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: The number of tree-rooted maps, that is, rooted planar maps with a distinguished spanning tree, of size n is C(n)C(n+1) where C(n)=binomial(2n,n)/(n+1) is the nth Catalan number. We present a (long awaited) simple bijection which explains this result. We prove that our bijection is isomorphic to a former recursive construction on shuffles of parenthesis systems due to Cori, Dulucq and Viennot.


Full work available at URL: https://arxiv.org/abs/math/0601684

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (44)





This page was built for publication: Bijective counting of tree-rooted maps and shuffles of parenthesis systems

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