Identifier
-
Mp00051:
Ordered trees
—to Dyck path⟶
Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000246: Permutations ⟶ ℤ (values match St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order.)
Values
[] => [] => [1,0] => [1] => 0
[[]] => [1,0] => [1,1,0,0] => [1,2] => 1
[[],[]] => [1,0,1,0] => [1,1,0,1,0,0] => [2,1,3] => 2
[[[]]] => [1,1,0,0] => [1,1,1,0,0,0] => [1,2,3] => 3
[[],[],[]] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [3,2,1,4] => 3
[[],[[]]] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [2,3,1,4] => 4
[[[]],[]] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [3,1,2,4] => 4
[[[],[]]] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [2,1,3,4] => 5
[[[[]]]] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 6
[[],[],[],[]] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [4,3,2,1,5] => 4
[[],[],[[]]] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [3,4,2,1,5] => 5
[[],[[]],[]] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [4,2,3,1,5] => 5
[[],[[],[]]] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [3,2,4,1,5] => 6
[[],[[[]]]] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [2,3,4,1,5] => 7
[[[]],[],[]] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [4,3,1,2,5] => 5
[[[]],[[]]] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [3,4,1,2,5] => 6
[[[],[]],[]] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [4,2,1,3,5] => 6
[[[[]]],[]] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [4,1,2,3,5] => 7
[[[],[],[]]] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [3,2,1,4,5] => 7
[[[],[[]]]] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [2,3,1,4,5] => 8
[[[[]],[]]] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [3,1,2,4,5] => 8
[[[[],[]]]] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [2,1,3,4,5] => 9
[[[[[]]]]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 10
[[],[],[],[],[]] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [5,4,3,2,1,6] => 5
[[],[],[],[[]]] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [4,5,3,2,1,6] => 6
[[],[],[[]],[]] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [5,3,4,2,1,6] => 6
[[],[],[[],[]]] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [4,3,5,2,1,6] => 7
[[],[],[[[]]]] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [3,4,5,2,1,6] => 8
[[],[[]],[],[]] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [5,4,2,3,1,6] => 6
[[],[[]],[[]]] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [4,5,2,3,1,6] => 7
[[],[[],[]],[]] => [1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [5,3,2,4,1,6] => 7
[[],[[[]]],[]] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [5,2,3,4,1,6] => 8
[[],[[],[],[]]] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [4,3,2,5,1,6] => 8
[[],[[],[[]]]] => [1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [3,4,2,5,1,6] => 9
[[],[[[]],[]]] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [4,2,3,5,1,6] => 9
[[],[[[],[]]]] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [3,2,4,5,1,6] => 10
[[],[[[[]]]]] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [2,3,4,5,1,6] => 11
[[[]],[],[],[]] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [5,4,3,1,2,6] => 6
[[[]],[],[[]]] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [4,5,3,1,2,6] => 7
[[[]],[[]],[]] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [5,3,4,1,2,6] => 7
[[[]],[[],[]]] => [1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [4,3,5,1,2,6] => 8
[[[]],[[[]]]] => [1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [3,4,5,1,2,6] => 9
[[[],[]],[],[]] => [1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [5,4,2,1,3,6] => 7
[[[[]]],[],[]] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [5,4,1,2,3,6] => 8
[[[],[]],[[]]] => [1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [4,5,2,1,3,6] => 8
[[[[]]],[[]]] => [1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [4,5,1,2,3,6] => 9
[[[],[],[]],[]] => [1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [5,3,2,1,4,6] => 8
[[[],[[]]],[]] => [1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [5,2,3,1,4,6] => 9
[[[[]],[]],[]] => [1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [5,3,1,2,4,6] => 9
[[[[],[]]],[]] => [1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [5,2,1,3,4,6] => 10
[[[[[]]]],[]] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [5,1,2,3,4,6] => 11
[[[],[],[],[]]] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [4,3,2,1,5,6] => 9
[[[],[],[[]]]] => [1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [3,4,2,1,5,6] => 10
[[[],[[]],[]]] => [1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [4,2,3,1,5,6] => 10
[[[],[[],[]]]] => [1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [3,2,4,1,5,6] => 11
[[[],[[[]]]]] => [1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [2,3,4,1,5,6] => 12
[[[[]],[],[]]] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [4,3,1,2,5,6] => 10
[[[[]],[[]]]] => [1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [3,4,1,2,5,6] => 11
[[[[],[]],[]]] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [4,2,1,3,5,6] => 11
[[[[[]]],[]]] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [4,1,2,3,5,6] => 12
[[[[],[],[]]]] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [3,2,1,4,5,6] => 12
[[[[],[[]]]]] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [2,3,1,4,5,6] => 13
[[[[[]],[]]]] => [1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [3,1,2,4,5,6] => 13
[[[[[],[]]]]] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [2,1,3,4,5,6] => 14
[[[[[[]]]]]] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,2,3,4,5,6] => 15
[[],[],[],[],[],[]] => [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] => [6,5,4,3,2,1,7] => 6
[[],[],[],[],[[]]] => [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] => [5,6,4,3,2,1,7] => 7
[[],[],[],[[],[]]] => [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] => [5,4,6,3,2,1,7] => 8
[[],[],[],[[[]]]] => [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] => [4,5,6,3,2,1,7] => 9
[[],[],[[]],[],[]] => [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] => [6,5,3,4,2,1,7] => 7
[[],[],[[],[]],[]] => [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] => [6,4,3,5,2,1,7] => 8
[[],[],[[[]]],[]] => [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] => [6,3,4,5,2,1,7] => 9
[[],[],[[],[],[]]] => [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] => [5,4,3,6,2,1,7] => 9
[[],[],[[],[[]]]] => [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] => [4,5,3,6,2,1,7] => 10
[[],[[],[],[]],[]] => [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] => [6,4,3,2,5,1,7] => 9
[[],[[],[[]]],[]] => [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] => [6,3,4,2,5,1,7] => 10
[[],[[],[],[],[]]] => [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] => [5,4,3,2,6,1,7] => 10
[[],[[[[[]]]]]] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,1,1,1,1,0,0,0,0,0,0] => [2,3,4,5,6,1,7] => 16
[[[]],[[]],[[]]] => [1,1,0,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,1,1,0,0,0] => [5,6,3,4,1,2,7] => 9
[[[[]]],[[[]]]] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,1,1,0,0,0,0] => [4,5,6,1,2,3,7] => 12
[[[[[]]]],[[]]] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,1,1,1,0,0,0,0,1,1,0,0,0] => [5,6,1,2,3,4,7] => 13
[[[[[[]]]]],[]] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0] => [6,1,2,3,4,5,7] => 16
[[[],[],[],[],[]]] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,1,0,0,0] => [5,4,3,2,1,6,7] => 11
[[[],[[[[]]]]]] => [1,1,0,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,1,1,1,0,0,0,0,0,0] => [2,3,4,5,1,6,7] => 17
[[[[[[]]]],[]]] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,1,1,0,0,0,0,1,0,0,0] => [5,1,2,3,4,6,7] => 17
[[[[],[],[],[]]]] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [4,3,2,1,5,6,7] => 15
[[[[],[[[]]]]]] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,1,1,0,1,1,1,0,0,0,0,0,0] => [2,3,4,1,5,6,7] => 18
[[[[[]],[[]]]]] => [1,1,1,1,0,0,1,1,0,0,0,0] => [1,1,1,1,1,0,0,1,1,0,0,0,0,0] => [3,4,1,2,5,6,7] => 17
[[[[[[]]],[]]]] => [1,1,1,1,1,0,0,0,1,0,0,0] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0] => [4,1,2,3,5,6,7] => 18
[[[[[],[],[]]]]] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [3,2,1,4,5,6,7] => 18
[[[[[],[[]]]]]] => [1,1,1,1,0,1,1,0,0,0,0,0] => [1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [2,3,1,4,5,6,7] => 19
[[[[[[]],[]]]]] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0] => [3,1,2,4,5,6,7] => 19
[[[[[[],[]]]]]] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [2,1,3,4,5,6,7] => 20
[[[[[[[]]]]]]] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7] => 21
[[],[],[],[],[],[],[]] => [1,0,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,1,0,0] => [7,6,5,4,3,2,1,8] => 7
[[],[],[],[],[],[[]]] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0] => [6,7,5,4,3,2,1,8] => 8
[[],[],[],[],[[],[]]] => [1,0,1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,0,1,0,1,1,0,1,0,0,0] => [6,5,7,4,3,2,1,8] => 9
[[],[],[],[],[[[]]]] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,1,0,1,1,1,0,0,0,0] => [5,6,7,4,3,2,1,8] => 10
[[],[],[],[[]],[],[]] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,1,0,1,0,0] => [7,6,4,5,3,2,1,8] => 8
[[],[],[],[[],[],[]]] => [1,0,1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,1,1,0,1,0,1,0,0,0] => [6,5,4,7,3,2,1,8] => 10
[[],[],[[]],[[]],[]] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,1,0,0,1,0,0] => [7,5,6,3,4,2,1,8] => 9
>>> Load all 146 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 non-inversions of a permutation.
For a permutation of $\{1,\ldots,n\}$, this is given by $\operatorname{noninv}(\pi) = \binom{n}{2}-\operatorname{inv}(\pi)$.
For a permutation of $\{1,\ldots,n\}$, this is given by $\operatorname{noninv}(\pi) = \binom{n}{2}-\operatorname{inv}(\pi)$.
Map
to 132-avoiding permutation
Description
Sends a Dyck path to a 132-avoiding permutation.
This bijection is defined in [1, Section 2].
This bijection is defined in [1, Section 2].
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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.
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!