Enumeration of bilaterally symmetric 3-noncrossing partitions

Details Enumeration of bilaterally symmetric 3-noncrossing partitions Enumeration of bilaterally symmetric 3-noncrossing partitions

2008-10-08

arxiv.org/abs/0810.1344v1

Mathematics

Combinatorics

22 pages

Scientific paper

10.1016/j.disc.2008.06.007

Schutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an analogue for involutions. In obtaining the analogous result for 3-noncrossing partitions, we use a different technique to develop a Maple package for 2-dimensional vacillating lattice walk enumeration problems. The package also applies to the hesitating case. As applications, we find several interesting relations for some special bilaterally symmetric partitions.

Affiliated with

Also associated with

No associations

Rating

Enumeration of bilaterally symmetric 3-noncrossing partitions 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 Enumeration of bilaterally symmetric 3-noncrossing partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of bilaterally symmetric 3-noncrossing partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29538