Partitions and Partial Matchings Avoiding Neighbor Patterns

Details Partitions and Partial Matchings Avoiding Neighbor Patterns Partitions and Partial Matchings Avoiding Neighbor Patterns

2010-09-23

arxiv.org/abs/1009.4535v1

Mathematics

Combinatorics

15 pages, 8 figures

Scientific paper

We obtain the generating functions for partial matchings avoiding neighbor alignments and for partial matchings avoiding neighbor alignments and left nestings. We show that there is a bijection between partial matchings avoiding three neighbor patterns (neighbor alignments, left nestings and right nestings) and set partitions avoiding right nestings via an intermediate structure of integer compositions. Such integer compositions are known to be in one-to-one correspondence with self-modified ascent sequences or $3\bar{1}52\bar{4}$-avoiding permutations, as shown by Bousquet-M\'elou, Claesson, Dukes and Kitaev.

Affiliated with

Also associated with

No associations

Rating

Partitions and Partial Matchings Avoiding Neighbor Patterns 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 Partitions and Partial Matchings Avoiding Neighbor Patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partitions and Partial Matchings Avoiding Neighbor Patterns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-338333