Identifier
-
Mp00051:
Ordered trees
—to Dyck path⟶
Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000318: Integer partitions ⟶ ℤ (values match St000159The number of distinct parts of the integer partition., St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition.)
Values
[] => [] => [] => [] => 1
[[]] => [1,0] => [1,0] => [] => 1
[[],[]] => [1,0,1,0] => [1,0,1,0] => [1] => 2
[[[]]] => [1,1,0,0] => [1,1,0,0] => [] => 1
[[],[],[]] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => [2,1] => 3
[[],[[]]] => [1,0,1,1,0,0] => [1,0,1,1,0,0] => [1,1] => 2
[[[]],[]] => [1,1,0,0,1,0] => [1,1,0,0,1,0] => [2] => 2
[[[],[]]] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,1] => 2
[[[[]]]] => [1,1,1,0,0,0] => [1,1,1,0,0,0] => [] => 1
[[],[],[],[]] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [3,2,1] => 4
[[],[],[[]]] => [1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => [2,2,1] => 3
[[],[[]],[]] => [1,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [3,1,1] => 3
[[],[[],[]]] => [1,0,1,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => [2,2,1] => 3
[[],[[[]]]] => [1,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,1] => 2
[[[]],[],[]] => [1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => [3,2] => 3
[[[]],[[]]] => [1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => [2,2] => 2
[[[],[]],[]] => [1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [3,1,1] => 3
[[[[]]],[]] => [1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => [3] => 2
[[[],[],[]]] => [1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => [2,2] => 2
[[[],[[]]]] => [1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,1] => 2
[[[[]],[]]] => [1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => [2,2] => 2
[[[[],[]]]] => [1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,1] => 2
[[[[[]]]]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [] => 1
[[],[],[],[],[]] => [1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [4,3,2,1] => 5
[[],[],[],[[]]] => [1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [3,3,2,1] => 4
[[],[],[[]],[]] => [1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [4,2,2,1] => 4
[[],[],[[],[]]] => [1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [3,3,2,1] => 4
[[],[],[[[]]]] => [1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [2,2,2,1] => 3
[[],[[]],[],[]] => [1,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [4,3,1,1] => 4
[[],[[]],[[]]] => [1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,3,1,1] => 3
[[],[[],[]],[]] => [1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [4,2,2,1] => 4
[[],[[[]]],[]] => [1,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [4,1,1,1] => 3
[[],[[],[],[]]] => [1,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,3,1,1] => 3
[[],[[],[[]]]] => [1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [2,2,2,1] => 3
[[],[[[]],[]]] => [1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,3,1,1] => 3
[[],[[[],[]]]] => [1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [2,2,2,1] => 3
[[],[[[[]]]]] => [1,0,1,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => 2
[[[]],[],[],[]] => [1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => [4,3,2] => 4
[[[]],[],[[]]] => [1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [3,3,2] => 3
[[[]],[[]],[]] => [1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [4,2,2] => 3
[[[]],[[],[]]] => [1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [3,3,2] => 3
[[[]],[[[]]]] => [1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,2,2] => 2
[[[],[]],[],[]] => [1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [4,3,1,1] => 4
[[[[]]],[],[]] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => [4,3] => 3
[[[],[]],[[]]] => [1,1,0,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,3,1,1] => 3
[[[[]]],[[]]] => [1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [3,3] => 2
[[[],[],[]],[]] => [1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [4,2,2] => 3
[[[],[[]]],[]] => [1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [4,1,1,1] => 3
[[[[]],[]],[]] => [1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [4,2,2] => 3
[[[[],[]]],[]] => [1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [4,1,1,1] => 3
[[[[[]]]],[]] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => [4] => 2
[[[],[],[],[]]] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,3,1,1] => 3
[[[],[],[[]]]] => [1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,2,2] => 2
[[[],[[]],[]]] => [1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,3,1,1] => 3
[[[],[[],[]]]] => [1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,2,2] => 2
[[[],[[[]]]]] => [1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => 2
[[[[]],[],[]]] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [3,3] => 2
[[[[]],[[]]]] => [1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,2,2] => 2
[[[[],[]],[]]] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [3,3] => 2
[[[[[]]],[]]] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [3,3] => 2
[[[[],[],[]]]] => [1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,2,2] => 2
[[[[],[[]]]]] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => 2
[[[[[]],[]]]] => [1,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,2,2] => 2
[[[[[],[]]]]] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1] => 2
[[[[[[]]]]]] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [] => 1
[[],[],[],[],[],[]] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => [5,4,3,2,1] => 6
[[],[],[],[],[[]]] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [4,4,3,2,1] => 5
[[],[],[],[[]],[]] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [5,3,3,2,1] => 5
[[],[],[],[[],[]]] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [4,4,3,2,1] => 5
[[],[],[],[[[]]]] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [3,3,3,2,1] => 4
[[],[],[[]],[],[]] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [5,4,2,2,1] => 5
[[],[],[[]],[[]]] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [4,4,2,2,1] => 4
[[],[],[[],[]],[]] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [5,3,3,2,1] => 5
[[],[],[[[]]],[]] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [5,2,2,2,1] => 4
[[],[],[[],[],[]]] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [4,4,2,2,1] => 4
[[],[],[[],[[]]]] => [1,0,1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [3,3,3,2,1] => 4
[[],[],[[[]],[]]] => [1,0,1,0,1,1,1,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [4,4,2,2,1] => 4
[[],[],[[[],[]]]] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [3,3,3,2,1] => 4
[[],[],[[[[]]]]] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [2,2,2,2,1] => 3
[[],[[]],[],[],[]] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [5,4,3,1,1] => 5
[[],[[]],[],[[]]] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => [4,4,3,1,1] => 4
[[],[[]],[[]],[]] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => [5,3,3,1,1] => 4
[[],[[]],[[],[]]] => [1,0,1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => [4,4,3,1,1] => 4
[[],[[]],[[[]]]] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [3,3,3,1,1] => 3
[[],[[],[]],[],[]] => [1,0,1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [5,4,2,2,1] => 5
[[],[[[]]],[],[]] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => [5,4,1,1,1] => 4
[[],[[],[]],[[]]] => [1,0,1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [4,4,2,2,1] => 4
[[],[[[]]],[[]]] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [4,4,1,1,1] => 3
[[],[[],[],[]],[]] => [1,0,1,1,0,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => [5,3,3,1,1] => 4
[[],[[],[[]]],[]] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [5,2,2,2,1] => 4
[[],[[[]],[]],[]] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => [5,3,3,1,1] => 4
[[],[[[],[]]],[]] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [5,2,2,2,1] => 4
[[],[[[[]]]],[]] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => [5,1,1,1,1] => 3
[[],[[],[],[],[]]] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [4,4,2,2,1] => 4
[[],[[],[],[[]]]] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [3,3,3,1,1] => 3
[[],[[],[[]],[]]] => [1,0,1,1,0,1,1,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [4,4,2,2,1] => 4
[[],[[],[[],[]]]] => [1,0,1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [3,3,3,1,1] => 3
[[],[[],[[[]]]]] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [2,2,2,2,1] => 3
[[],[[[]],[],[]]] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [4,4,1,1,1] => 3
[[],[[[]],[[]]]] => [1,0,1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [3,3,3,1,1] => 3
[[],[[[],[]],[]]] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [4,4,1,1,1] => 3
>>> Load all 235 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 addable cells of the Ferrers diagram of an integer partition.
Map
to Dyck path
Description
Return the Dyck path of the corresponding ordered tree induced by the recurrence of the Catalan numbers, see wikipedia:Catalan_number.
This sends the maximal height of the Dyck path to the depth of the tree.
This sends the maximal height of the Dyck path to the depth of the tree.
Map
bounce path
Description
Sends a Dyck path D of length 2n to its bounce path.
This path is formed by starting at the endpoint (n,n) of D and travelling west until encountering the first vertical step of D, then south until hitting the diagonal, then west again to hit D, etc. until the point (0,0) is reached.
This map is the first part of the zeta map Mp00030zeta map.
This path is formed by starting at the endpoint (n,n) of D and travelling west until encountering the first vertical step of D, then south until hitting the diagonal, then west again to hit D, etc. until the point (0,0) is reached.
This map is the first part of the zeta map Mp00030zeta map.
Map
to partition
Description
The cut-out partition of a Dyck path.
The partition λ associated to a Dyck path is defined to be the complementary partition inside the staircase partition (n−1,…,2,1) when cutting out D considered as a path from (0,0) to (n,n).
In other words, λi is the number of down-steps before the (n+1−i)-th up-step of D.
This map is a bijection between Dyck paths of size n and partitions inside the staircase partition (n−1,…,2,1).
The partition λ associated to a Dyck path is defined to be the complementary partition inside the staircase partition (n−1,…,2,1) when cutting out D considered as a path from (0,0) to (n,n).
In other words, λi is the number of down-steps before the (n+1−i)-th up-step of D.
This map is a bijection between Dyck paths of size n and partitions inside the staircase partition (n−1,…,2,1).
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!