Pattern avoidance in ordered set partitions
From MaRDI portal
Publication:404537
DOI10.1007/S00026-014-0232-YzbMATH Open1295.05014arXiv1212.2530OpenAlexW2140612883MaRDI QIDQ404537FDOQ404537
Authors: Jennifer Herdan, Anant P. Godbole, Adam M. Goyt, Lara Pudwell 
Publication date: 4 September 2014
Published in: Annals of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1212.2530
Recommendations
Cites Work
- Enumeration schemes and, more importantly, their automatic generation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Restricted permutations
- On \(abab\)-free and \(abba\)-free set partitions
- Pattern avoidance in set partitions.
- On pattern-avoiding partitions
- Combinatorics of Set Partitions
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- Finite automata and pattern avoidance in words
- Combinatorics of Compositions and Words
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Title not available (Why is that?)
- Pattern avoidance in ordered set partitions and words
- Ordered partitions avoiding a permutation pattern of length 3
- Enumeration schemes for words avoiding permutations
- Resurrecting the asymptotics of linear recurrences
- Enumeration Schemes for Restricted Permutations
- Set partition statistics and \(q\)-Fibonacci numbers
- Avoidance of partitions of a three-element set
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Three-letter-pattern avoiding permutations and functional equations
- Avoiding colored partitions of lengths two and three
- Avoiding colored partitions of two elements in the pattern sense
Cited In (15)
- Avoiding colored partitions of two elements in the pattern sense
- The sets of flattened partitions with forbidden patterns
- On pattern avoiding flattened set partitions
- On pattern-avoiding partitions
- The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic
- Counting set partitions by the number of movable letters
- Pattern avoidance in poset permutations
- Pattern avoidance in set partitions.
- Patterns in words of ordered set partitions
- Combinatorial generation via permutation languages. VI: Binary trees
- Large sets avoiding patterns
- Title not available (Why is that?)
- Pattern avoidance in ordered set partitions and words
- Ordered partitions avoiding a permutation pattern of length 3
- Pattern avoiding partitions and Motzkin left factors
Uses Software
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)
