LongestDecreasingSubsequence on IntegerComposition
The length of a longest strictly decreasing subsequence of the parts.
The number of rows of the RSK shape of the composition as a word (Greene-Kleitman).
Called as CombinatorialStat(x, "LongestDecreasingSubsequence"). The head's page has its examples.
Live
Distribution
Over IntegerCompositions at each size, tallied here in your browser; sizes past 6 are not offered.
Also on
The same name on other carriers, each its own implementation: Permutation.
FindStat St000760
The length of the longest strictly decreasing subsequence of parts of an integer composition.
| Object | Value |
|---|---|
[1] | 1 |
[2] | 1 |
[3] | 1 |
[4] | 1 |
[5] | 1 |
[6] | 1 |
[7] | 1 |
[8] | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St000760 has the rest.