Identifier
Values
[1] => 0
[1,1] => 0
[1,2] => 1
[2,1] => 0
[1,1,1] => 0
[1,1,2] => 1
[1,2,1] => 1
[2,1,1] => 0
[1,1,3] => 1
[1,3,1] => 1
[3,1,1] => 0
[1,2,2] => 1
[2,1,2] => 1
[2,2,1] => 0
[1,2,3] => 2
[1,3,2] => 1
[2,1,3] => 1
[2,3,1] => 1
[3,1,2] => 1
[3,2,1] => 0
[1,1,1,1] => 0
[1,1,1,2] => 1
[1,1,2,1] => 1
[1,2,1,1] => 1
[2,1,1,1] => 0
[1,1,1,3] => 1
[1,1,3,1] => 1
[1,3,1,1] => 1
[3,1,1,1] => 0
[1,1,1,4] => 1
[1,1,4,1] => 1
[1,4,1,1] => 1
[4,1,1,1] => 0
[1,1,2,2] => 1
[1,2,1,2] => 2
[1,2,2,1] => 1
[2,1,1,2] => 1
[2,1,2,1] => 1
[2,2,1,1] => 0
[1,1,2,3] => 2
[1,1,3,2] => 1
[1,2,1,3] => 2
[1,2,3,1] => 2
[1,3,1,2] => 2
[1,3,2,1] => 1
[2,1,1,3] => 1
[2,1,3,1] => 1
[2,3,1,1] => 1
[3,1,1,2] => 1
[3,1,2,1] => 1
[3,2,1,1] => 0
[1,1,2,4] => 2
[1,1,4,2] => 1
[1,2,1,4] => 2
[1,2,4,1] => 2
[1,4,1,2] => 2
[1,4,2,1] => 1
[2,1,1,4] => 1
[2,1,4,1] => 1
[2,4,1,1] => 1
[4,1,1,2] => 1
[4,1,2,1] => 1
[4,2,1,1] => 0
[1,1,3,3] => 1
[1,3,1,3] => 2
[1,3,3,1] => 1
[3,1,1,3] => 1
[3,1,3,1] => 1
[3,3,1,1] => 0
[1,1,3,4] => 2
[1,1,4,3] => 1
[1,3,1,4] => 2
[1,3,4,1] => 2
[1,4,1,3] => 2
[1,4,3,1] => 1
[3,1,1,4] => 1
[3,1,4,1] => 1
[3,4,1,1] => 1
[4,1,1,3] => 1
[4,1,3,1] => 1
[4,3,1,1] => 0
[1,2,2,2] => 1
[2,1,2,2] => 1
[2,2,1,2] => 1
[2,2,2,1] => 0
[1,2,2,3] => 2
[1,2,3,2] => 2
[1,3,2,2] => 1
[2,1,2,3] => 2
[2,1,3,2] => 1
[2,2,1,3] => 1
[2,2,3,1] => 1
[2,3,1,2] => 2
[2,3,2,1] => 1
[3,1,2,2] => 1
[3,2,1,2] => 1
[3,2,2,1] => 0
[1,2,2,4] => 2
[1,2,4,2] => 2
[1,4,2,2] => 1
[2,1,2,4] => 2
>>> Load all 1200 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The number of ascents in a parking function.
This is the number of indices $i$ such that $p_i > p_{i+1}$.
This is the number of indices $i$ such that $p_i > p_{i+1}$.
References
[1] Cruz, A., Harris, P. E., Harry, K. J., Kretschmann, J., McClinton, M., Moon, A., Museus, J. O., Redmon, E. On some discrete statistics of parking functions arXiv:2312.16786
Code
def statistic(p):
return sum(1 for i in range(len(p)-1) if p[i] < p[i+1])
Created
Dec 29, 2023 at 14:38 by Martin Rubey
Updated
Dec 29, 2023 at 14:38 by Martin Rubey
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!