Enumerating permutations avoiding more than three Babson - Steingr\'ı msson patterns

Details Enumerating permutations avoiding more than three Babson - Steingr\'ı msson patterns Enumerating permutations avoiding more than three Babson - Steingr\'ı msson patterns

2007-04-26

arxiv.org/abs/0704.3565v1

Mathematics

Combinatorics

Scientific paper

Not long ago, Claesson and Mansour proposed some conjectures about the enumeration of the permutations avoiding more than three Babson - Steingr\'\i msson patterns (generalized patterns of type $(1,2)$ or $(2,1)$). The avoidance of one, two or three patterns has already been considered. Here, the cases of four and five forbidden patterns are solved and the exact enumeration of the permutations avoiding them is given, confirming the conjectures of Claesson and Mansour. The approach we use can be easily extended to the cases of more than five forbidden patterns.

Affiliated with

Also associated with

No associations

Rating

Enumerating permutations avoiding more than three Babson - Steingr\'ı msson 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 Enumerating permutations avoiding more than three Babson - Steingr\'ı msson patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerating permutations avoiding more than three Babson - Steingr\'ı msson patterns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-373234