Permutations of a multiset avoiding permutations of length 3
From MaRDI portal
A sequence of numbers \(\alpha =(a_{1},\dots ,a_{m})\) is contained in a sequence of numbers \(\beta =(b_{1},\dots ,b_{n})\) if there is a subsequence \((b_{i_{1}},\dots,b_{i_{m}})\), \(i_{1}<\dots <i_{m},\) so that \(a_{s}\leq a_{t}\) iff \(b_{i_{s}}\leq b_{i_{t}}.\) In the paper the permutations of a multiset which do not contain certain subsequences of length \(3\) are considered, in many cases an enumeration of such permutations is given.
Recommendations
Cites work
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Classification of forbidden subsequences of length 4
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Forbidden subsequences
- Generalized Stack Permutations
- Generating trees and the Catalan and Schröder numbers
- scientific article; zbMATH DE number 3492580 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 3420624 (Why is no real title available?)
- Permutations which are the union of an increasing and a decreasing subsequence
- Priority queues and multisets
- Restricted permutations
- Sorting Using Networks of Queues and Stacks
- The permutation classes equinumerous to the smooth class
Cited in
(18)- Finite automata and pattern avoidance in words
- Central limit theorems for patterns in multiset permutations and set partitions
- Pattern avoidance in biwords
- Pattern avoidance of generalized permutations
- A new class of multiset Wilf equivalent pairs
- Pattern avoidance in compositions and multiset permutations
- Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method
- The (ordinary) generating functions enumerating 123-avoiding words with r occurrences of each of 1, 2, , n are always algebraic
- Pattern avoidance in poset permutations
- Stack-sorting for words
- Enumeration formulæ for pattern restricted Stirling permutations
- Sorting Cayley permutations with pattern-avoiding machines
- On avoiding 1233
- Crossings over permutations avoiding some pairs of patterns of length three
- scientific article; zbMATH DE number 7106992 (Why is no real title available?)
- scientific article; zbMATH DE number 969096 (Why is no real title available?)
- Words over a finite alphabet avoiding 1243
- Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
This page was built for publication: Permutations of a multiset avoiding permutations of length 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952148)
