Pattern avoidance in ordered set partitions
From MaRDI portal
Publication:404537
DOI10.1007/S00026-014-0232-YzbMath1295.05014arXiv1212.2530OpenAlexW2140612883MaRDI QIDQ404537
Jennifer Herdan, Adam M. Goyt, Anant P. Godbole, Lara K. Pudwell
Publication date: 4 September 2014
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.2530
Related Items (5)
The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic ⋮ Pattern avoidance in poset permutations ⋮ Pattern avoidance in ordered set partitions and words ⋮ Ordered partitions avoiding a permutation pattern of length 3 ⋮ Counting set partitions by the number of movable letters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Avoidance of partitions of a three-element set
- On pattern-avoiding partitions
- Resurrecting the asymptotics of linear recurrences
- Enumeration schemes and, more importantly, their automatic generation
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- Finite automata and pattern avoidance in words
- On \(abab\)-free and \(abba\)-free set partitions
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Pattern avoidance in ordered set partitions and words
- Ordered partitions avoiding a permutation pattern of length 3
- Three-letter-pattern avoiding permutations and functional equations
- Set partition statistics and \(q\)-Fibonacci numbers
- Avoiding Colored Partitions of Lengths Two and Three
- Combinatorics of Set Partitions
- Combinatorics of Compositions and Words
- Avoiding colored partitions of two elements in the pattern sense
- Enumeration Schemes for Restricted Permutations
- Restricted permutations
This page was built for publication: Pattern avoidance in ordered set partitions
