Identifier
Values
{{1}} => [1] => [.,.] => [[],[]] => 2
{{1,2}} => [2,1] => [[.,.],.] => [[[],[]],[]] => 2
{{1},{2}} => [1,2] => [.,[.,.]] => [[],[[],[]]] => 2
{{1,2,3}} => [2,3,1] => [[.,[.,.]],.] => [[[],[[],[]]],[]] => 2
{{1,2},{3}} => [2,1,3] => [[.,.],[.,.]] => [[[],[]],[[],[]]] => 8
{{1,3},{2}} => [3,2,1] => [[[.,.],.],.] => [[[[],[]],[]],[]] => 2
{{1},{2,3}} => [1,3,2] => [.,[[.,.],.]] => [[],[[[],[]],[]]] => 2
{{1},{2},{3}} => [1,2,3] => [.,[.,[.,.]]] => [[],[[],[[],[]]]] => 2
{{1},{2,3,4}} => [1,3,4,2] => [.,[[.,[.,.]],.]] => [[],[[[],[[],[]]],[]]] => 2
{{1},{2,3},{4}} => [1,3,2,4] => [.,[[.,.],[.,.]]] => [[],[[[],[]],[[],[]]]] => 8
{{1},{2,4},{3}} => [1,4,3,2] => [.,[[[.,.],.],.]] => [[],[[[[],[]],[]],[]]] => 2
{{1},{2},{3,4}} => [1,2,4,3] => [.,[.,[[.,.],.]]] => [[],[[],[[[],[]],[]]]] => 2
{{1},{2},{3},{4}} => [1,2,3,4] => [.,[.,[.,[.,.]]]] => [[],[[],[[],[[],[]]]]] => 2
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 size of the automorphism group of the ordered tree.
Map
to complete tree
Description
Return the same tree seen as an ordered tree. By default, leaves are transformed into actual nodes.
Map
to permutation
Description
Sends the set partition to the permutation obtained by considering the blocks as increasing cycles.
Map
to increasing tree
Description
Sends a permutation to its associated increasing tree.
This tree is recursively obtained by sending the unique permutation of length $0$ to the empty tree, and sending a permutation $\sigma$ of length $n \geq 1$ to a root node with two subtrees $L$ and $R$ by splitting $\sigma$ at the index $\sigma^{-1}(1)$, normalizing both sides again to permutations and sending the permutations on the left and on the right of $\sigma^{-1}(1)$ to the trees $L$ and $R$, respectively.