Processing math: 100%

Identifier
Values
[1] => [1,0,1,0] => [1,0,1,0] => [[1,1],[]] => 1
[2] => [1,1,0,0,1,0] => [1,1,0,0,1,0] => [[2,2],[1]] => 1
[1,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => [[3],[]] => 1
[3] => [1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => [[2,2,2],[1]] => 1
[2,1] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => [[1,1,1],[]] => 1
[3,1] => [1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [[2,2,1],[1]] => 1
[2,2] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,0,0] => [[3,2],[]] => 1
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => [[3,1],[]] => 1
[3,2] => [1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => [[2,2,2],[1,1]] => 1
[3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,0] => [[3,3],[2]] => 1
[2,2,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0] => [[4],[]] => 1
[4,2] => [1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [[3,3,2],[2,1]] => 1
[3,2,1] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [[1,1,1,1],[]] => 1
[4,2,1] => [1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [[2,2,1,1],[1]] => 1
[3,2,2] => [1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => [[4,2],[1]] => 1
[3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => [[3,1,1],[]] => 1
[4,3,1] => [1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [[2,2,2,1],[1,1]] => 1
[4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,0,1,0] => [[3,3,1],[2]] => 1
[3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => [[4,1],[]] => 1
[4,3,2] => [1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => [[2,2,2,2],[1,1,1]] => 1
[4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,0,1,0] => [[3,3,3],[2,2]] => 1
[4,2,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,0] => [[4,4],[3]] => 1
[3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [[5],[]] => 1
[4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [[1,1,1,1,1],[]] => 1
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 connected components of a skew partition.
Map
Adin-Bagno-Roichman transformation
Description
The Adin-Bagno-Roichman transformation of a Dyck path.
This is a bijection preserving the number of up steps before each peak and sending the number of returns to the number of up steps after the last double up step.
Map
skew partition
Description
The parallelogram polyomino corresponding to a Dyck path, interpreted as a skew partition.
Let D be a Dyck path of semilength n. The parallelogram polyomino γ(D) is defined as follows: let ˜D=d0d1d2n+1 be the Dyck path obtained by prepending an up step and appending a down step to D. Then, the upper path of γ(D) corresponds to the sequence of steps of ˜D with even indices, and the lower path of γ(D) corresponds to the sequence of steps of ˜D with odd indices.
This map returns the skew partition definded by the diagram of γ(D).
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.