Permutations of a multiset avoiding permutations of length 3
From MaRDI portal
Publication:5952148
DOI10.1006/eujc.2001.0538zbMath0988.05005OpenAlexW2067114330MaRDI QIDQ5952148
Derek Holton, M. D. Atkinson, R. E. L. Aldred, C. C. Handley, Michael Henry Albert
Publication date: 24 June 2002
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.2001.0538
Related Items (14)
Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method ⋮ On avoiding 1233 ⋮ The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic ⋮ Unnamed Item ⋮ Pattern avoidance in poset permutations ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ Central limit theorems for patterns in multiset permutations and set partitions ⋮ Pattern avoidance of generalized permutations ⋮ Enumeration formulæ for pattern restricted Stirling permutations ⋮ A new class of multiset Wilf equivalent pairs ⋮ Pattern avoidance in biwords ⋮ Pattern avoidance in compositions and multiset permutations ⋮ Finite automata and pattern avoidance in words ⋮ Stack-sorting for Words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forbidden subsequences
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Permutations which are the union of an increasing and a decreasing subsequence
- The permutation classes equinumerous to the smooth class
- Generating trees and the Catalan and Schröder numbers
- Priority queues and multisets
- Classification of forbidden subsequences of length 4
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Generalized Stack Permutations
- Sorting Using Networks of Queues and Stacks
- Restricted permutations
This page was built for publication: Permutations of a multiset avoiding permutations of length 3
