Enumerating set partitions according to the number of descents of size d or more
From MaRDI portal
(Redirected from Publication:351035)
Enumerating set partitions according to the number of descents of size \(d\) or more
Enumerating set partitions according to the number of descents of size \(d\) or more
Recommendations
Cites work
- scientific article; zbMATH DE number 2186869 (Why is no real title available?)
- scientific article; zbMATH DE number 5870286 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1919509 (Why is no real title available?)
- A major index for matchings and set partitions
- A q-Analog of Restricted Growth Functions, Dobinski's Equality, and Charlier Polynomials
- An inversion number statistic on set partitions
- Counting subwords in a partition of a set
- Enumeration of partitions by long rises, levels, and descents
- On \(abab\)-free and \(abba\)-free set partitions
Cited in
(9)- scientific article; zbMATH DE number 6322891 (Why is no real title available?)
- scientific article; zbMATH DE number 5870286 (Why is no real title available?)
- Two by two squares in set partitions
- Enumeration of partitions by long rises, levels, and descents
- Elements protected by records in set partitions
- Recounting the number of rises, levels, and descents in finite set partitions
- Counting visible levels in bargraphs and set partitions
- New refined enumerations of set partitions related to sorting
- Counting peaks and valleys in a partition of a set
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)