Permutations Containing and Avoiding $\textit{123}$ and $\textit{132}$ Patterns
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 \ge 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: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
1999-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/261/pdf |