FlattenedAscentTopsAfterSmaller on SetPartition
Ascent tops of the flattened word with every smaller element earlier.
The binary logarithm of the number of set partitions with the same flattened word.
Called as CombinatorialStat(x, "FlattenedAscentTopsAfterSmaller"). The head's page has its examples.
Live
Distribution
Over SetPartitions at each size, tallied here in your browser; sizes past 10 are not offered.
FindStat St001641
The number of ascent tops in the flattened set partition such that all smaller elements appear before.
| Object | Value |
|---|---|
{{1}} | 0 |
{{1,2}} | 1 |
{{1,2,3}} | 2 |
{{1},{2}} | 1 |
{{1,2,3,4}} | 3 |
{{1,2},{3}} | 2 |
{{1,3},{2}} | 0 |
{{1},{2,3}} | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001641 has the rest.