The most and the least avoided consecutive patterns

Details The most and the least avoided consecutive patterns The most and the least avoided consecutive patterns

2012-03-07

arxiv.org/abs/1203.1636v1

Mathematics

Combinatorics

Scientific paper

We prove that the number of permutations avoiding an arbitrary consecutive pattern of length m is asymptotically largest when the avoided pattern is 12...m, and smallest when the avoided pattern is 12...(m-2)m(m-1). This settles a conjecture of the author and Noy from 2001, as well as another recent conjecture of Nakamura. We also show that among non-overlapping patterns of length m, the pattern 134...m2 is the one for which the number of permutations avoiding it is asymptotically largest.

Affiliated with

Also associated with

No associations

Rating

The most and the least avoided consecutive 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 The most and the least avoided consecutive patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The most and the least avoided consecutive patterns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-15910