CenterSize on ParkingFunction
The length of the longest subsequence a(1), ..., a(k) with a(i) <= i.
FindStat's St001937. Taking each entry that fits the next index is the longest such subsequence.
Called as CombinatorialStat(x, "CenterSize"). The head's page has its examples.
Live
Distribution
Over ParkingFunctions at each size, tallied here in your browser; sizes past 6 are not offered.
FindStat St001937
The size of the center of a parking function.
| Object | Value |
|---|---|
[1] | 1 |
[1,1] | 2 |
[1,2] | 2 |
[2,1] | 1 |
[1,1,1] | 3 |
[1,1,2] | 3 |
[1,1,3] | 3 |
[1,2,1] | 3 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001937 has the rest.