Bijective counting of involutive Baxter permutations

Details Bijective counting of involutive Baxter permutations Bijective counting of involutive Baxter permutations

2010-10-19

arxiv.org/abs/1010.3850v2

Mathematics

Combinatorics

8 pages

Scientific paper

We enumerate bijectively the family of involutive Baxter permutations according to various parameters; in particular we obtain an elementary proof that the number of involutive Baxter permutations of size $2n$ with no fixed points is $\frac{3\cdot 2^{n-1}}{(n+1)(n+2)}\binom{2n}{n}$, a formula originally discovered by M. Bousquet-M\'elou using generating functions. The same coefficient also enumerates planar maps with $n$ edges, endowed with an acyclic orientation having a unique source, and such that the source and sinks are all incident to the outer face.

Affiliated with

Also associated with

No associations

Rating

Bijective counting of involutive Baxter permutations 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 involutive Baxter permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bijective counting of involutive Baxter permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-268644