Enumerating set partitions according to the number of descents of size \(d\) or more (Q351035)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumerating set partitions according to the number of descents of size d or more |
scientific article; zbMATH DE number 6183366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating set partitions according to the number of descents of size \(d\) or more |
scientific article; zbMATH DE number 6183366 |
Statements
Enumerating set partitions according to the number of descents of size \(d\) or more (English)
0 references
3 July 2013
0 references
set partitions
0 references
descents
0 references
partition statistic
0 references
combinatorial proof
0 references
0 references
0.8073581457138062
0 references
0.7921287417411804
0 references
0.7831709980964661
0 references
