Abstract
We consider pattern containment and avoidance with a very tight definition that was used first in several papers more than 60 years ago. Using this definition, we prove that the monotone pattern is easier to avoid than almost any other pattern of the same length. We also show that with this definition, almost all patterns of length k are avoided by the same number of permutations of length n . The corresponding statements are not known to be true for more relaxed definitions of pattern containment. This is the first time we know of that expectations have been used to compare numbers of permutations avoiding certain patterns.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
