Ordered partitions avoiding a permutation pattern of length 3

DOI10.1016/j.ejc.2013.09.001zbMath1284.05034arXiv1304.3187MaRDI QIDQ2441648

William Y. C. Chen, Robin D. P. Zhou, Alvin Y. L. Dai

Publication date: 25 March 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.3187

zbMATH Keywords

bivariate generating function; pattern avoiding set partitions

Mathematics Subject Classification ID

05A18: Partitions of sets

05A05: Permutations, words, matrices

Related Items

Restricted generating trees for weak orderings, 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, Pattern avoidance in ordered set partitions and words

Uses Software

• FindRec

Cites Work

• Unnamed Item
• Unnamed Item
• Pattern avoidance in ordered set partitions
• The descent statistic on 123-avoiding permutations
• Avoidance of partitions of a three-element set
• On pattern-avoiding partitions
• Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
• On \(abab\)-free and \(abba\)-free set partitions
• Priority queues and multisets
• Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
• Pattern avoidance in ordered set partitions and words