Counting subwords in flattened partitions of sets

DOI10.1016/J.DISC.2015.04.023zbMath1314.05022OpenAlexW1020257647MaRDI QIDQ2352065

Toufik Mansour, Mark Shattuck, Stephan G. Wagner

Publication date: 29 June 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.04.023

zbMATH Keywords

kernel methodasymptotic enumerationpattern avoidanceflattened set partitionssubword patterns

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Related Items (10)

Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method ⋮ Counting occurrences of subword patterns in non-crossing partitions ⋮ The runsort permuton ⋮ Peaks are preserved under run-sorting ⋮ Merging-Free Partitions and Run-Sorted Permutations ⋮ Unnamed Item ⋮ Run Distribution Over Flattened Partitions ⋮ The sets of flattened partitions with forbidden patterns ⋮ Counting set partitions by the number of movable letters ⋮ Counting subword patterns in permutations arising as flattened partitions of sets

Uses Software

• OEIS
• WILF
• HERB
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting subwords in flattened permutations
• Set partition asymptotics and a conjecture of Gould and Quaintance
• Patterns in permutations and words.
• Pattern avoidance in ``flattened partitions
• q-Catalan numbers
• The Riordan group
• Enumeration schemes and, more importantly, their automatic generation
• Counting subwords in a partition of a set
• Kernel method and linear recurrence system
• Combinatorics of Set Partitions
• Combinatorics of Compositions and Words
• Recurrence relations in counting the pattern 13-2 in flattened permutations

This page was built for publication: Counting subwords in flattened partitions of sets