Identifier
-
Mp00141:
Binary trees
—pruning number to logarithmic height⟶
Dyck paths
Mp00233: Dyck paths —skew partition⟶ Skew partitions
St001597: Skew partitions ⟶ ℤ
Values
[.,.] => [1,0] => [[1],[]] => 1
[.,[.,.]] => [1,0,1,0] => [[1,1],[]] => 1
[[.,.],.] => [1,1,0,0] => [[2],[]] => 1
[.,[.,[.,.]]] => [1,0,1,0,1,0] => [[1,1,1],[]] => 1
[.,[[.,.],.]] => [1,0,1,1,0,0] => [[2,1],[]] => 1
[[.,.],[.,.]] => [1,1,1,0,0,0] => [[2,2],[]] => 2
[[.,[.,.]],.] => [1,1,0,0,1,0] => [[2,2],[1]] => 1
[[[.,.],.],.] => [1,1,0,1,0,0] => [[3],[]] => 1
[.,[.,[.,[.,.]]]] => [1,0,1,0,1,0,1,0] => [[1,1,1,1],[]] => 1
[.,[.,[[.,.],.]]] => [1,0,1,0,1,1,0,0] => [[2,1,1],[]] => 1
[.,[[.,.],[.,.]]] => [1,0,1,1,1,0,0,0] => [[2,2,1],[]] => 2
[.,[[.,[.,.]],.]] => [1,0,1,1,0,0,1,0] => [[2,2,1],[1]] => 1
[.,[[[.,.],.],.]] => [1,0,1,1,0,1,0,0] => [[3,1],[]] => 1
[[.,.],[.,[.,.]]] => [1,1,1,0,0,0,1,0] => [[2,2,2],[1]] => 2
[[.,.],[[.,.],.]] => [1,1,1,0,0,1,0,0] => [[3,2],[]] => 2
[[.,[.,.]],[.,.]] => [1,1,1,0,1,0,0,0] => [[2,2,2],[]] => 2
[[[.,.],.],[.,.]] => [1,1,1,1,0,0,0,0] => [[3,3],[]] => 2
[[.,[.,[.,.]]],.] => [1,1,0,0,1,0,1,0] => [[2,2,2],[1,1]] => 1
[[.,[[.,.],.]],.] => [1,1,0,0,1,1,0,0] => [[3,2],[1]] => 1
[[[.,.],[.,.]],.] => [1,1,0,1,1,0,0,0] => [[3,3],[1]] => 2
[[[.,[.,.]],.],.] => [1,1,0,1,0,0,1,0] => [[3,3],[2]] => 1
[[[[.,.],.],.],.] => [1,1,0,1,0,1,0,0] => [[4],[]] => 1
[.,[.,[.,[.,[.,.]]]]] => [1,0,1,0,1,0,1,0,1,0] => [[1,1,1,1,1],[]] => 1
[.,[.,[.,[[.,.],.]]]] => [1,0,1,0,1,0,1,1,0,0] => [[2,1,1,1],[]] => 1
[.,[.,[[.,.],[.,.]]]] => [1,0,1,0,1,1,1,0,0,0] => [[2,2,1,1],[]] => 2
[.,[.,[[.,[.,.]],.]]] => [1,0,1,0,1,1,0,0,1,0] => [[2,2,1,1],[1]] => 1
[.,[.,[[[.,.],.],.]]] => [1,0,1,0,1,1,0,1,0,0] => [[3,1,1],[]] => 1
[.,[[.,.],[.,[.,.]]]] => [1,0,1,1,1,0,0,0,1,0] => [[2,2,2,1],[1]] => 2
[.,[[.,.],[[.,.],.]]] => [1,0,1,1,1,0,0,1,0,0] => [[3,2,1],[]] => 2
[.,[[.,[.,.]],[.,.]]] => [1,0,1,1,1,0,1,0,0,0] => [[2,2,2,1],[]] => 2
[.,[[[.,.],.],[.,.]]] => [1,0,1,1,1,1,0,0,0,0] => [[3,3,1],[]] => 2
[.,[[.,[.,[.,.]]],.]] => [1,0,1,1,0,0,1,0,1,0] => [[2,2,2,1],[1,1]] => 1
[.,[[.,[[.,.],.]],.]] => [1,0,1,1,0,0,1,1,0,0] => [[3,2,1],[1]] => 1
[.,[[[.,.],[.,.]],.]] => [1,0,1,1,0,1,1,0,0,0] => [[3,3,1],[1]] => 2
[.,[[[.,[.,.]],.],.]] => [1,0,1,1,0,1,0,0,1,0] => [[3,3,1],[2]] => 1
[.,[[[[.,.],.],.],.]] => [1,0,1,1,0,1,0,1,0,0] => [[4,1],[]] => 1
[[.,.],[.,[.,[.,.]]]] => [1,1,1,0,0,0,1,0,1,0] => [[2,2,2,2],[1,1]] => 2
[[.,.],[.,[[.,.],.]]] => [1,1,1,0,0,0,1,1,0,0] => [[3,2,2],[1]] => 2
[[.,.],[[.,.],[.,.]]] => [1,1,1,0,0,1,1,0,0,0] => [[3,3,2],[1]] => 3
[[.,.],[[.,[.,.]],.]] => [1,1,1,0,0,1,0,0,1,0] => [[3,3,2],[2]] => 2
[[.,.],[[[.,.],.],.]] => [1,1,1,0,0,1,0,1,0,0] => [[4,2],[]] => 2
[[.,[.,.]],[.,[.,.]]] => [1,1,1,0,1,0,0,0,1,0] => [[2,2,2,2],[1]] => 2
[[.,[.,.]],[[.,.],.]] => [1,1,1,0,1,0,0,1,0,0] => [[3,2,2],[]] => 2
[[[.,.],.],[.,[.,.]]] => [1,1,1,1,0,0,0,0,1,0] => [[3,3,3],[2]] => 2
[[[.,.],.],[[.,.],.]] => [1,1,1,1,0,0,0,1,0,0] => [[4,3],[]] => 2
[[.,[.,[.,[.,.]]]],.] => [1,1,0,0,1,0,1,0,1,0] => [[2,2,2,2],[1,1,1]] => 1
[[.,[.,[[.,.],.]]],.] => [1,1,0,0,1,0,1,1,0,0] => [[3,2,2],[1,1]] => 1
[[.,[[.,.],[.,.]]],.] => [1,1,0,0,1,1,1,0,0,0] => [[3,3,2],[1,1]] => 2
[[.,[[.,[.,.]],.]],.] => [1,1,0,0,1,1,0,0,1,0] => [[3,3,2],[2,1]] => 1
[[.,[[[.,.],.],.]],.] => [1,1,0,0,1,1,0,1,0,0] => [[4,2],[1]] => 1
[[[.,.],[.,[.,.]]],.] => [1,1,0,1,1,0,0,0,1,0] => [[3,3,3],[2,1]] => 2
[[[.,.],[[.,.],.]],.] => [1,1,0,1,1,0,0,1,0,0] => [[4,3],[1]] => 2
[[[.,[.,.]],[.,.]],.] => [1,1,0,1,1,0,1,0,0,0] => [[3,3,3],[1,1]] => 2
[[[[.,.],.],[.,.]],.] => [1,1,0,1,1,1,0,0,0,0] => [[4,4],[1]] => 2
[[[.,[.,[.,.]]],.],.] => [1,1,0,1,0,0,1,0,1,0] => [[3,3,3],[2,2]] => 1
[[[.,[[.,.],.]],.],.] => [1,1,0,1,0,0,1,1,0,0] => [[4,3],[2]] => 1
[[[[.,.],[.,.]],.],.] => [1,1,0,1,0,1,1,0,0,0] => [[4,4],[2]] => 2
[[[[.,[.,.]],.],.],.] => [1,1,0,1,0,1,0,0,1,0] => [[4,4],[3]] => 1
[[[[[.,.],.],.],.],.] => [1,1,0,1,0,1,0,1,0,0] => [[5],[]] => 1
[.,[.,[.,[.,[.,[.,.]]]]]] => [1,0,1,0,1,0,1,0,1,0,1,0] => [[1,1,1,1,1,1],[]] => 1
[.,[.,[.,[.,[[.,.],.]]]]] => [1,0,1,0,1,0,1,0,1,1,0,0] => [[2,1,1,1,1],[]] => 1
[.,[.,[.,[[.,.],[.,.]]]]] => [1,0,1,0,1,0,1,1,1,0,0,0] => [[2,2,1,1,1],[]] => 2
[.,[.,[.,[[.,[.,.]],.]]]] => [1,0,1,0,1,0,1,1,0,0,1,0] => [[2,2,1,1,1],[1]] => 1
[.,[.,[.,[[[.,.],.],.]]]] => [1,0,1,0,1,0,1,1,0,1,0,0] => [[3,1,1,1],[]] => 1
[.,[.,[[.,.],[.,[.,.]]]]] => [1,0,1,0,1,1,1,0,0,0,1,0] => [[2,2,2,1,1],[1]] => 2
[.,[.,[[.,.],[[.,.],.]]]] => [1,0,1,0,1,1,1,0,0,1,0,0] => [[3,2,1,1],[]] => 2
[.,[.,[[.,[.,[.,.]]],.]]] => [1,0,1,0,1,1,0,0,1,0,1,0] => [[2,2,2,1,1],[1,1]] => 1
[.,[.,[[.,[[.,.],.]],.]]] => [1,0,1,0,1,1,0,0,1,1,0,0] => [[3,2,1,1],[1]] => 1
[.,[.,[[[.,.],[.,.]],.]]] => [1,0,1,0,1,1,0,1,1,0,0,0] => [[3,3,1,1],[1]] => 2
[.,[.,[[[.,[.,.]],.],.]]] => [1,0,1,0,1,1,0,1,0,0,1,0] => [[3,3,1,1],[2]] => 1
[.,[.,[[[[.,.],.],.],.]]] => [1,0,1,0,1,1,0,1,0,1,0,0] => [[4,1,1],[]] => 1
[.,[[.,.],[.,[.,[.,.]]]]] => [1,0,1,1,1,0,0,0,1,0,1,0] => [[2,2,2,2,1],[1,1]] => 2
[.,[[.,.],[.,[[.,.],.]]]] => [1,0,1,1,1,0,0,0,1,1,0,0] => [[3,2,2,1],[1]] => 2
[.,[[.,.],[[.,[.,.]],.]]] => [1,0,1,1,1,0,0,1,0,0,1,0] => [[3,3,2,1],[2]] => 2
[.,[[.,.],[[[.,.],.],.]]] => [1,0,1,1,1,0,0,1,0,1,0,0] => [[4,2,1],[]] => 2
[.,[[.,[.,[.,[.,.]]]],.]] => [1,0,1,1,0,0,1,0,1,0,1,0] => [[2,2,2,2,1],[1,1,1]] => 1
[.,[[.,[.,[[.,.],.]]],.]] => [1,0,1,1,0,0,1,0,1,1,0,0] => [[3,2,2,1],[1,1]] => 1
[.,[[.,[[.,.],[.,.]]],.]] => [1,0,1,1,0,0,1,1,1,0,0,0] => [[3,3,2,1],[1,1]] => 2
[.,[[.,[[.,[.,.]],.]],.]] => [1,0,1,1,0,0,1,1,0,0,1,0] => [[3,3,2,1],[2,1]] => 1
[.,[[.,[[[.,.],.],.]],.]] => [1,0,1,1,0,0,1,1,0,1,0,0] => [[4,2,1],[1]] => 1
[.,[[[.,.],[.,[.,.]]],.]] => [1,0,1,1,0,1,1,0,0,0,1,0] => [[3,3,3,1],[2,1]] => 2
[.,[[[.,.],[[.,.],.]],.]] => [1,0,1,1,0,1,1,0,0,1,0,0] => [[4,3,1],[1]] => 2
[.,[[[.,[.,[.,.]]],.],.]] => [1,0,1,1,0,1,0,0,1,0,1,0] => [[3,3,3,1],[2,2]] => 1
[.,[[[.,[[.,.],.]],.],.]] => [1,0,1,1,0,1,0,0,1,1,0,0] => [[4,3,1],[2]] => 1
[.,[[[[.,.],[.,.]],.],.]] => [1,0,1,1,0,1,0,1,1,0,0,0] => [[4,4,1],[2]] => 2
[.,[[[[.,[.,.]],.],.],.]] => [1,0,1,1,0,1,0,1,0,0,1,0] => [[4,4,1],[3]] => 1
[.,[[[[[.,.],.],.],.],.]] => [1,0,1,1,0,1,0,1,0,1,0,0] => [[5,1],[]] => 1
[[.,.],[.,[.,[.,[.,.]]]]] => [1,1,1,0,0,0,1,0,1,0,1,0] => [[2,2,2,2,2],[1,1,1]] => 2
[[.,.],[.,[.,[[.,.],.]]]] => [1,1,1,0,0,0,1,0,1,1,0,0] => [[3,2,2,2],[1,1]] => 2
[[.,.],[.,[[.,[.,.]],.]]] => [1,1,1,0,0,0,1,1,0,0,1,0] => [[3,3,2,2],[2,1]] => 2
[[.,.],[.,[[[.,.],.],.]]] => [1,1,1,0,0,0,1,1,0,1,0,0] => [[4,2,2],[1]] => 2
[[.,.],[[.,[.,[.,.]]],.]] => [1,1,1,0,0,1,0,0,1,0,1,0] => [[3,3,3,2],[2,2]] => 2
[[.,.],[[.,[[.,.],.]],.]] => [1,1,1,0,0,1,0,0,1,1,0,0] => [[4,3,2],[2]] => 2
[[.,.],[[[.,[.,.]],.],.]] => [1,1,1,0,0,1,0,1,0,0,1,0] => [[4,4,2],[3]] => 2
[[.,.],[[[[.,.],.],.],.]] => [1,1,1,0,0,1,0,1,0,1,0,0] => [[5,2],[]] => 2
[[.,[.,[.,[.,[.,.]]]]],.] => [1,1,0,0,1,0,1,0,1,0,1,0] => [[2,2,2,2,2],[1,1,1,1]] => 1
[[.,[.,[.,[[.,.],.]]]],.] => [1,1,0,0,1,0,1,0,1,1,0,0] => [[3,2,2,2],[1,1,1]] => 1
[[.,[.,[[.,.],[.,.]]]],.] => [1,1,0,0,1,0,1,1,1,0,0,0] => [[3,3,2,2],[1,1,1]] => 2
[[.,[.,[[.,[.,.]],.]]],.] => [1,1,0,0,1,0,1,1,0,0,1,0] => [[3,3,2,2],[2,1,1]] => 1
[[.,[.,[[[.,.],.],.]]],.] => [1,1,0,0,1,0,1,1,0,1,0,0] => [[4,2,2],[1,1]] => 1
[[.,[[.,.],[.,[.,.]]]],.] => [1,1,0,0,1,1,1,0,0,0,1,0] => [[3,3,3,2],[2,1,1]] => 2
>>> Load all 187 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 Frobenius rank of a skew partition.
This is the minimal number of border strips in a border strip decomposition of the skew partition.
This is the minimal number of border strips in a border strip decomposition of the skew partition.
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 $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
This map returns the skew partition definded by the diagram of $\gamma(D)$.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
This map returns the skew partition definded by the diagram of $\gamma(D)$.
Map
pruning number to logarithmic height
Description
Francon's map from binary trees to Dyck paths.
This bijection sends the pruning number of the binary tree, St000396The register function (or Horton-Strahler number) of a binary tree., to the logarithmic height of the Dyck path, St000920The logarithmic height of a Dyck path.. The implementation is a literal translation of Knuth's [2].
This bijection sends the pruning number of the binary tree, St000396The register function (or Horton-Strahler number) of a binary tree., to the logarithmic height of the Dyck path, St000920The logarithmic height of a Dyck path.. The implementation is a literal translation of Knuth's [2].
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!