On pattern avoiding flattened set partitions

DOI10.1007/s10114-015-5153-0zbMath1334.05003OpenAlexW2242757888MaRDI QIDQ272514

Thomas Y. H. Liu, Andy Q. Zhang

Publication date: 20 April 2016

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-015-5153-0

zbMATH Keywords

pattern avoidanceflattened partitionset partition

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05)

Related Items (2)

Peaks are preserved under run-sorting ⋮ The sets of flattened partitions with forbidden patterns

Cites Work

• Unnamed Item
• Counting subwords in flattened permutations
• Pattern avoidance in ``flattened partitions
• Catalan, Motzkin, and Riordan numbers
• Combinatorics of Set Partitions
• Recurrence relations in counting the pattern 13-2 in flattened permutations
• Recurrence relations for patterns of type (2,1) in flattened permutations
• Permutations with restricted patterns and Dyck paths

This page was built for publication: On pattern avoiding flattened set partitions