Pattern avoidance in ``flattened partitions
From MaRDI portal
Publication:1043596
DOI10.1016/j.disc.2008.11.019zbMath1189.05003arXiv0802.2275MaRDI QIDQ1043596
Publication date: 9 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0802.2275
05A05: Permutations, words, matrices
Related Items
Recurrence relations in counting the pattern 13-2 in flattened permutations, Recurrence relations for patterns of type (2,1) in flattened permutations, Counting subwords in flattened partitions of sets
Cites Work
- Unnamed Item
- Avoidance of partitions of a three-element set
- On pattern-avoiding partitions
- A short proof of an identity of Touchard's concerning Catalan numbers
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- On \(abab\)-free and \(abba\)-free set partitions
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Permutations with restricted patterns and Dyck paths