Pattern avoidance in ordered set partitions
From MaRDI portal
Publication:404537
Abstract: In this paper we consider the enumeration of ordered set partitions avoiding a permutation pattern of length 2 or 3. We provide an exact enumeration for avoiding the permutation 12. We also give exact enumeration for ordered partitions with 3 blocks and ordered partitions with n-1 blocks avoiding a permutation of length 3. We use enumeration schemes to recursively enumerate 123-avoiding ordered partitions with any block sizes. Finally, we give some asymptotic results for the growth rates of the number of ordered set partitions avoiding a single pattern; including a Stanley-Wilf type that exhibits existence of such growth rates.
Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 964350 (Why is no real title available?)
- Avoidance of partitions of a three-element set
- Avoiding colored partitions of lengths two and three
- Avoiding colored partitions of two elements in the pattern sense
- Combinatorics of Compositions and Words
- Combinatorics of set partitions
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- Enumeration Schemes for Restricted Permutations
- Enumeration schemes and, more importantly, their automatic generation
- Enumeration schemes for words avoiding permutations
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Finite automata and pattern avoidance in words
- On \(abab\)-free and \(abba\)-free set partitions
- On pattern-avoiding partitions
- Ordered partitions avoiding a permutation pattern of length 3
- Pattern avoidance in ordered set partitions and words
- Pattern avoidance in set partitions.
- Restricted permutations
- Resurrecting the asymptotics of linear recurrences
- Set partition statistics and \(q\)-Fibonacci numbers
- Three-letter-pattern avoiding permutations and functional equations
Cited in
(18)- Pattern avoidance in set partitions.
- On pattern avoiding flattened set partitions
- On pattern-avoiding partitions
- Ordered partitions avoiding a permutation pattern of length 3
- Combinatorial generation via permutation languages. VI: Binary trees
- scientific article; zbMATH DE number 5870280 (Why is no real title available?)
- Avoiding type \((1,2)\) or \((2,1)\) patterns in a partition of a set
- Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings
- Patterns in words of ordered set partitions
- Left-right arrangements, set partitions and pattern avoidance
- Avoiding colored partitions of two elements in the pattern sense
- Counting set partitions by the number of movable letters
- Pattern avoidance in poset permutations
- The sets of flattened partitions with forbidden patterns
- Pattern avoiding partitions and Motzkin left factors
- The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic
- Pattern avoidance in ordered set partitions and words
- Large sets avoiding patterns
This page was built for publication: Pattern avoidance in ordered set partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404537)
