Identifier
-
Mp00199:
Dyck paths
—prime Dyck path⟶
Dyck paths
Mp00026: Dyck paths —to ordered tree⟶ Ordered trees
St000521: Ordered trees ⟶ ℤ
Values
[1,0] => [1,1,0,0] => [[[]]] => 3
[1,0,1,0] => [1,1,0,1,0,0] => [[[],[]]] => 3
[1,1,0,0] => [1,1,1,0,0,0] => [[[[]]]] => 4
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [[[],[],[]]] => 3
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [[[],[[]]]] => 4
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [[[[]],[]]] => 4
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [[[[],[]]]] => 4
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [[[[[]]]]] => 5
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [[[],[],[],[]]] => 3
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [[[],[],[[]]]] => 4
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [[[],[[]],[]]] => 4
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [[[],[[],[]]]] => 4
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [[[],[[[]]]]] => 5
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [[[[]],[],[]]] => 4
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [[[[]],[[]]]] => 4
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [[[[],[]],[]]] => 4
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [[[[],[],[]]]] => 4
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [[[[],[[]]]]] => 5
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [[[[[]]],[]]] => 5
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [[[[[]],[]]]] => 5
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [[[[[],[]]]]] => 5
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [[[[[[]]]]]] => 6
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [[[],[],[],[],[]]] => 3
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [[[],[],[],[[]]]] => 4
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [[[],[],[[]],[]]] => 4
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [[[],[],[[],[]]]] => 4
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [[[],[],[[[]]]]] => 5
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [[[],[[]],[],[]]] => 4
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [[[],[[]],[[]]]] => 4
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [[[],[[],[]],[]]] => 4
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [[[],[[],[],[]]]] => 4
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [[[],[[],[[]]]]] => 5
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [[[],[[[]]],[]]] => 5
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [[[],[[[]],[]]]] => 5
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [[[],[[[],[]]]]] => 5
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [[[],[[[[]]]]]] => 6
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [[[[]],[],[],[]]] => 4
[1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [[[[]],[],[[]]]] => 4
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [[[[]],[[]],[]]] => 4
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [[[[]],[[],[]]]] => 5
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [[[[]],[[[]]]]] => 5
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [[[[],[]],[],[]]] => 4
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [[[[],[]],[[]]]] => 5
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [[[[],[],[]],[]]] => 4
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [[[[],[],[],[]]]] => 4
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [[[[],[],[[]]]]] => 5
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [[[[],[[]]],[]]] => 5
[1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [[[[],[[]],[]]]] => 5
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [[[[],[[],[]]]]] => 5
[1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [[[[],[[[]]]]]] => 6
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [[[[[]]],[],[]]] => 5
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [[[[[]]],[[]]]] => 5
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [[[[[]],[]],[]]] => 5
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [[[[[]],[],[]]]] => 5
[1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [[[[[]],[[]]]]] => 5
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [[[[[],[]]],[]]] => 5
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [[[[[],[]],[]]]] => 5
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [[[[[],[],[]]]]] => 5
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [[[[[],[[]]]]]] => 6
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [[[[[[]]]],[]]] => 6
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [[[[[[]]],[]]]] => 6
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [[[[[[]],[]]]]] => 6
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [[[[[[],[]]]]]] => 6
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [[[[[[[]]]]]]] => 7
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [[[],[],[],[],[],[]]] => 3
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,1,0,0,0] => [[[],[],[],[],[[]]]] => 4
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,1,0,0] => [[[],[],[],[[]],[]]] => 4
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,0,1,1,0,1,0,0,0] => [[[],[],[],[[],[]]]] => 4
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,1,1,1,0,0,0,0] => [[[],[],[],[[[]]]]] => 5
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,1,0,0] => [[[],[],[[]],[],[]]] => 4
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,1,1,0,0,0] => [[[],[],[[]],[[]]]] => 4
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,0,1,1,0,1,0,0,1,0,0] => [[[],[],[[],[]],[]]] => 4
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,1,0,0,0] => [[[],[],[[],[],[]]]] => 4
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,1,1,0,0,0,0] => [[[],[],[[],[[]]]]] => 5
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,1,0,0] => [[[],[],[[[]]],[]]] => 5
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,0,1,1,1,0,0,1,0,0,0] => [[[],[],[[[]],[]]]] => 5
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,1,0,1,0,0,0,0] => [[[],[],[[[],[]]]]] => 5
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,1,1,1,0,0,0,0,0] => [[[],[],[[[[]]]]]] => 6
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,1,0,0] => [[[],[[]],[],[],[]]] => 4
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,1,0,0,1,0,1,1,0,0,0] => [[[],[[]],[],[[]]]] => 4
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,1,0,0,1,0,0] => [[[],[[]],[[]],[]]] => 4
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,1,1,0,1,0,0,0] => [[[],[[]],[[],[]]]] => 5
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,1,0,0,1,1,1,0,0,0,0] => [[[],[[]],[[[]]]]] => 5
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,1,0,0] => [[[],[[],[]],[],[]]] => 4
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,1,1,0,0,0] => [[[],[[],[]],[[]]]] => 5
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,1,0,0,1,0,0] => [[[],[[],[],[]],[]]] => 4
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,1,0,0,0] => [[[],[[],[],[],[]]]] => 4
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,1,1,0,0,0,0] => [[[],[[],[],[[]]]]] => 5
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,1,1,0,0,0,1,0,0] => [[[],[[],[[]]],[]]] => 5
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,1,1,0,0,1,0,0,0] => [[[],[[],[[]],[]]]] => 5
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,1,1,0,1,1,0,1,0,0,0,0] => [[[],[[],[[],[]]]]] => 5
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,1,0,1,1,1,0,0,0,0,0] => [[[],[[],[[[]]]]]] => 6
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,1,0,0] => [[[],[[[]]],[],[]]] => 5
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,1,0,0,0,1,1,0,0,0] => [[[],[[[]]],[[]]]] => 5
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,1,1,0,0,1,0,0,1,0,0] => [[[],[[[]],[]],[]]] => 5
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,1,0,0,0] => [[[],[[[]],[],[]]]] => 5
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,1,0,0,1,1,0,0,0,0] => [[[],[[[]],[[]]]]] => 5
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,1,0,1,0,0,0,1,0,0] => [[[],[[[],[]]],[]]] => 5
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,1,0,1,0,0,1,0,0,0] => [[[],[[[],[]],[]]]] => 5
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,1,0,0,0,0] => [[[],[[[],[],[]]]]] => 5
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,1,0,1,1,0,0,0,0,0] => [[[],[[[],[[]]]]]] => 6
>>> Load all 197 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 distinct subtrees of an ordered tree.
A subtree is specified by a node of the tree. Thus, the tree consisting of a single path has as many subtrees as nodes, whereas the tree of height two, having all leaves attached to the root, has only two distinct subtrees. Because we consider ordered trees, the tree $[[[[]], []], [[], [[]]]]$ on nine nodes has five distinct subtrees.
A subtree is specified by a node of the tree. Thus, the tree consisting of a single path has as many subtrees as nodes, whereas the tree of height two, having all leaves attached to the root, has only two distinct subtrees. Because we consider ordered trees, the tree $[[[[]], []], [[], [[]]]]$ on nine nodes has five distinct subtrees.
Map
to ordered tree
Description
Sends a Dyck path to the ordered tree encoding the heights of the path.
This map is recursively defined as follows: A Dyck path $D$ of semilength $n$ may be decomposed, according to its returns (St000011The number of touch points (or returns) of a Dyck path.), into smaller paths $D_1,\dots,D_k$ of respective semilengths $n_1,\dots,n_k$ (so one has $n = n_1 + \dots n_k$) each of which has no returns.
Denote by $\tilde D_i$ the path of semilength $n_i-1$ obtained from $D_i$ by removing the initial up- and the final down-step.
This map then sends $D$ to the tree $T$ having a root note with ordered children $T_1,\dots,T_k$ which are again ordered trees computed from $D_1,\dots,D_k$ respectively.
The unique path of semilength $1$ is sent to the tree consisting of a single node.
This map is recursively defined as follows: A Dyck path $D$ of semilength $n$ may be decomposed, according to its returns (St000011The number of touch points (or returns) of a Dyck path.), into smaller paths $D_1,\dots,D_k$ of respective semilengths $n_1,\dots,n_k$ (so one has $n = n_1 + \dots n_k$) each of which has no returns.
Denote by $\tilde D_i$ the path of semilength $n_i-1$ obtained from $D_i$ by removing the initial up- and the final down-step.
This map then sends $D$ to the tree $T$ having a root note with ordered children $T_1,\dots,T_k$ which are again ordered trees computed from $D_1,\dots,D_k$ respectively.
The unique path of semilength $1$ is sent to the tree consisting of a single node.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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!