Enumerating set partitions according to the number of descents of size d or more
From MaRDI portal
Publication:351035
DOI10.1007/S12044-012-0098-ZzbMATH Open1268.05024OpenAlexW1989739553MaRDI QIDQ351035FDOQ351035
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- On \(abab\)-free and \(abba\)-free set partitions
- Counting subwords in a partition of a set
- Title not available (Why is that?)
- Title not available (Why is that?)
- An inversion number statistic on set partitions
- Enumeration of partitions by long rises, levels, and descents
- A q-Analog of Restricted Growth Functions, Dobinski's Equality, and Charlier Polynomials
- Title not available (Why is that?)
- A major index for matchings and set partitions
Cited In (9)
- Title not available (Why is that?)
- Two by two squares in set partitions
- Counting peaks and valleys in a partition of a set
- Counting visible levels in bargraphs and set partitions
- Recounting the number of rises, levels, and descents in finite set partitions
- Title not available (Why is that?)
- New refined enumerations of set partitions related to sorting
- Elements protected by records in set partitions
- Enumeration of partitions by long rises, levels, and descents
This page was built for publication: Enumerating set partitions according to the number of descents of size \(d\) or more
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q351035)
