Equivalence classes of permutations modulo replacements between 123 and two-integer patterns
From MaRDI portal
Publication:405257
zbMath1300.05009arXiv1309.4802MaRDI QIDQ405257
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.4802
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting permutations modulo pattern-replacement equivalences for three-letter patterns
- Patterns in permutations and words.
- New results on families of pattern-replacement equivalences
- Permutations, matrices, and generalized Young tableaux
- Longest Increasing and Decreasing Subsequences
- The forgotten monoid
- THE CHINESE MONOID
- Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions
- Restricted permutations