Permutations Containing and Avoiding 123and 132Patterns
We prove that the number of permutations which avoid 132-patterns and have exactly one 123-pattern, equals (n-2)2 n-3, for n≥3. We then give a bijection onto the set of permutations which avoid 123-patterns and have exactly one 132-pattern. Finally, we show that the number of permutations...
Main Author: | Aaron Robertson |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
1999-12-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/104 |
Similar Items
-
Permutations Containing and Avoiding $\textit{123}$ and $\textit{132}$ Patterns
by: Aaron Robertson
Published: (1999-01-01) -
Pattern Popularity in 132-Avoiding Permutations
by: Rudolph, Kate
Published: (2014) -
A relation on 132-avoiding permutation patterns
by: Natalie Aisbett
Published: (2015-12-01) -
Equipopularity Classes of 132-Avoiding Permutations
by: Chua, Lynn, et al.
Published: (2014) -
Quadrant marked mesh patterns in 123-avoiding permutations
by: Dun Qiu, et al.
Published: (2018-08-01)