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

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

2006-01-27

arxiv.org/abs/math/0601684v1

The Electronic Journal of Combinatorics 14 (2007) R9

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bijective counting of tree-rooted maps and shuffles of parenthesis systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bijective counting of tree-rooted maps and shuffles of parenthesis systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bijective counting of tree-rooted maps and shuffles of parenthesis systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-506183