Counting set partitions by the number of movable letters

DOI10.1080/10236198.2020.1739275zbMath1435.05029OpenAlexW3012493968MaRDI QIDQ5220691

Toufik Mansour, Mark Shattuck

Publication date: 27 March 2020

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10236198.2020.1739275

zbMATH Keywords

generating functionset partitionsnon-crossing partitioncombinatorial statistic

Mathematics Subject Classification ID

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

Related Items (1)

Alphabetic points in restricted growth functions

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern avoidance in ordered set partitions
• Generalized Stirling and Lah numbers
• On \(abab\)-free and \(abba\)-free set partitions
• On multiple pattern avoiding set partitions
• Counting subwords in flattened partitions of sets
• Counting subwords in a partition of a set
• A q-Analog of Restricted Growth Functions, Dobinski's Equality, and Charlier Polynomials
• Counting corners in compositions and set partitions presented as bargraphs
• Elements protected by records in set partitions
• Combinatorics of Set Partitions
• Bargraph statistics on words and set partitions

This page was built for publication: Counting set partitions by the number of movable letters