Enumerating set partitions according to the number of descents of size \(d\) or more

DOI10.1007/s12044-012-0098-zzbMath1268.05024OpenAlexW1989739553MaRDI QIDQ351035

Toufik Mansour, Mark Shattuck, Chunwei Song

Publication date: 3 July 2013

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12044-012-0098-z

zbMATH Keywords

set partitionsdescentscombinatorial proofpartition statistic

Mathematics Subject Classification ID

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

Related Items (3)

Two by two squares in set partitions ⋮ Elements protected by records in set partitions ⋮ Counting visible levels in bargraphs and set partitions

Cites Work

• A major index for matchings and set partitions
• On \(abab\)-free and \(abba\)-free set partitions
• Counting subwords in a partition of a set
• An inversion number statistic on set partitions
• A q-Analog of Restricted Growth Functions, Dobinski's Equality, and Charlier Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerating set partitions according to the number of descents of size \(d\) or more