Where the monotone pattern (mostly) rules
From MaRDI portal
Publication:998460
DOI10.1016/J.DISC.2007.10.030zbMATH Open1186.05003arXiv0704.1489OpenAlexW1995381083MaRDI QIDQ998460FDOQ998460
Authors: Miklós Bóna
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: We consider pattern containment and avoidance with a very tight definition that was used first by Riordan more than 60 years ago. Using this definition, we prove 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 are avoided by the same number of permutations of length . 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 are used to compare numbers of permutations avoiding certain patterns.
Full work available at URL: https://arxiv.org/abs/0704.1489
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized permutation patterns and a classification of the Mahonian statistics
- Consecutive patterns in permutations
- Permutations without 3-sequences
- The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns
- New records in Stanley-Wilf limits
- Counting permutations by their rigid patterns
- A note on permutations without runs of given length
- Title not available (Why is that?)
- The Asymptotic Distribution of Runs of Consecutive Elements
- Note on Runs of Consecutive Elements
Cited In (5)
This page was built for publication: Where the monotone pattern (mostly) rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998460)