Identifier
Values
{{1}} => [1] => [1] => [1] => 0
{{1,2}} => [2,1] => [1,2] => [1,2] => 0
{{1},{2}} => [1,2] => [1,2] => [1,2] => 0
{{1,2,3}} => [2,3,1] => [1,2,3] => [1,2,3] => 0
{{1,2},{3}} => [2,1,3] => [1,2,3] => [1,2,3] => 0
{{1,3},{2}} => [3,2,1] => [1,3,2] => [1,3,2] => 1
{{1},{2,3}} => [1,3,2] => [1,2,3] => [1,2,3] => 0
{{1},{2},{3}} => [1,2,3] => [1,2,3] => [1,2,3] => 0
{{1,2,3,4}} => [2,3,4,1] => [1,2,3,4] => [1,2,3,4] => 0
{{1,2,3},{4}} => [2,3,1,4] => [1,2,3,4] => [1,2,3,4] => 0
{{1,2,4},{3}} => [2,4,3,1] => [1,2,4,3] => [1,2,4,3] => 1
{{1,2},{3,4}} => [2,1,4,3] => [1,2,3,4] => [1,2,3,4] => 0
{{1,2},{3},{4}} => [2,1,3,4] => [1,2,3,4] => [1,2,3,4] => 0
{{1,3,4},{2}} => [3,2,4,1] => [1,3,4,2] => [1,3,4,2] => 1
{{1,3},{2,4}} => [3,4,1,2] => [1,3,2,4] => [1,3,2,4] => 1
{{1,3},{2},{4}} => [3,2,1,4] => [1,3,2,4] => [1,3,2,4] => 1
{{1,4},{2,3}} => [4,3,2,1] => [1,4,2,3] => [1,4,2,3] => 1
{{1},{2,3,4}} => [1,3,4,2] => [1,2,3,4] => [1,2,3,4] => 0
{{1},{2,3},{4}} => [1,3,2,4] => [1,2,3,4] => [1,2,3,4] => 0
{{1,4},{2},{3}} => [4,2,3,1] => [1,4,2,3] => [1,4,2,3] => 1
{{1},{2,4},{3}} => [1,4,3,2] => [1,2,4,3] => [1,2,4,3] => 1
{{1},{2},{3,4}} => [1,2,4,3] => [1,2,3,4] => [1,2,3,4] => 0
{{1},{2},{3},{4}} => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
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
click to show known generating functions       
Description
The number of descents in a parking function.
This is the number of indices $i$ such that $p_i > p_{i+1}$.
Map
to permutation
Description
Sends the set partition to the permutation obtained by considering the blocks as increasing cycles.
Map
cycle-as-one-line notation
Description
Return the permutation obtained by concatenating the cycles of a permutation, each written with minimal element first, sorted by minimal element.
Map
parking function
Description
Interpret the permutation as a parking function.