Counting occurrences of subword patterns in non-crossing partitions

DOI10.26493/2590-9770.1552.b43OpenAlexW4309721831WikidataQ130258096 ScholiaQ130258096MaRDI QIDQ5888416

Mark Shattuck, Toufik Mansour

Publication date: 25 April 2023

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/2590-9770.1552.b43

zbMATH Keywords

set partitionnon-crossing partitioncombinatorial statisticsubword pattern

Mathematics Subject Classification ID

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

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On 1212-avoiding restricted growth functions
• Two statistics linking Dyck paths and non-crossing partitions
• Generalized Stirling and Lah numbers
• Dyck path enumeration
• Combinatorial statistics on non-crossing partitions
• On \(abab\)-free and \(abba\)-free set partitions
• Counting subwords in flattened partitions of sets
• Counting subwords in a partition of a set
• Counting strings in Dyck paths
• Some set partition statistics in non-crossing partitions and generating functions
• Kernel method and linear recurrence system
• Counting subwords in flattened involutions and Kummer functions
• A q-Analog of Restricted Growth Functions, Dobinski's Equality, and Charlier Polynomials
• Visibility in non-crossing and non-nesting partitions

This page was built for publication: Counting occurrences of subword patterns in non-crossing partitions