- FindStat

Identifier

Mp00051: Ordered trees —to Dyck path⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St000647: Permutations ⟶ ℤ

Values

[] => [] => [1,0] => [2,1] => 0
[[]] => [1,0] => [1,1,0,0] => [2,3,1] => 1
[[],[]] => [1,0,1,0] => [1,1,0,1,0,0] => [4,3,1,2] => 1
[[[]]] => [1,1,0,0] => [1,1,1,0,0,0] => [2,3,4,1] => 1
[[],[],[]] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [5,4,1,2,3] => 1
[[],[[]]] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [4,3,1,5,2] => 2
[[[]],[]] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [2,5,4,1,3] => 1
[[[],[]]] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [5,3,4,1,2] => 2
[[[[]]]] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 1
[[],[],[],[]] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [5,6,1,2,3,4] => 1
[[],[],[[]]] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [5,4,1,2,6,3] => 2
[[],[[]],[]] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [6,3,1,5,2,4] => 3
[[],[[],[]]] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [6,4,1,5,2,3] => 3
[[],[[[]]]] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [4,3,1,5,6,2] => 2
[[[]],[],[]] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [2,6,5,1,3,4] => 1
[[[]],[[]]] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [2,5,4,1,6,3] => 2
[[[],[]],[]] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [6,3,5,1,2,4] => 2
[[[[]]],[]] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => 1
[[[],[],[]]] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [6,5,4,1,2,3] => 1
[[[],[[]]]] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [5,3,4,1,6,2] => 3
[[[[]],[]]] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [2,6,4,5,1,3] => 2
[[[[],[]]]] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [6,3,4,5,1,2] => 2
[[[[[]]]]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => 1
[[],[],[],[],[]] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [7,6,1,2,3,4,5] => 1
[[],[],[],[[]]] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [5,6,1,2,3,7,4] => 2
[[[]],[],[],[]] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [2,6,7,1,3,4,5] => 1
[[[[],[],[]]]] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [7,6,4,5,1,2,3] => 2
[[[[[[]]]]]] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [2,3,4,5,6,7,1] => 1
[[],[],[],[],[],[]] => [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] => [8,7,1,2,3,4,5,6] => 1
[[[]],[],[],[[]]] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,0,1,1,0,0,0] => [2,6,7,1,3,4,8,5] => 2
[[[],[]],[[],[]]] => [1,1,0,1,0,0,1,1,0,1,0,0] => [1,1,1,0,1,0,0,1,1,0,1,0,0,0] => [6,3,8,1,2,7,4,5] => 3
[[[],[],[],[],[]]] => [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] => [6,7,8,1,2,3,4,5] => 1
[[[],[[],[]],[]]] => [1,1,0,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,1,0,1,0,0,1,0,0,0] => [7,8,4,1,6,2,3,5] => 3
[[[],[[[]]],[]]] => [1,1,0,1,1,1,0,0,0,1,0,0] => [1,1,1,0,1,1,1,0,0,0,1,0,0,0] => [8,3,4,1,6,7,2,5] => 3
[[[[]],[],[[]]]] => [1,1,1,0,0,1,0,1,1,0,0,0] => [1,1,1,1,0,0,1,0,1,1,0,0,0,0] => [2,7,6,5,1,3,8,4] => 2
[[[[],[[]],[]]]] => [1,1,1,0,1,1,0,0,1,0,0,0] => [1,1,1,1,0,1,1,0,0,1,0,0,0,0] => [8,3,6,5,1,7,2,4] => 3
[[[[[],[],[]]]]] => [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] => [8,7,4,5,6,1,2,3] => 2
[[[[[[[]]]]]]] => [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] => [2,3,4,5,6,7,8,1] => 1
[[],[],[],[],[],[],[]] => [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] => [8,9,1,2,3,4,5,6,7] => 1
[[[],[],[],[],[],[]]] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0] => [9,7,8,1,2,3,4,5,6] => 2
[[[[[[[[]]]]]]]] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 1
[[],[],[],[],[],[],[],[]] => [1,0,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,1,0,0] => [10,9,1,2,3,4,5,6,7,8] => 1
[[[],[],[],[],[],[],[]]] => [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,0] => [10,9,8,1,2,3,4,5,6,7] => 1
[[[[],[],[],[],[],[]]]] => [1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0,0] => [7,8,9,10,1,2,3,4,5,6] => 1
[[[[[[[[[]]]]]]]]] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,1] => 1

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

$F_{1} = 1$

$F_{2} = q$

$F_{3} = 2\ q$

$F_{4} = 3\ q + 2\ q^{2}$

$F_{5} = 5\ q + 6\ q^{2} + 3\ q^{3}$

Description

The number of big descents of a permutation.
For a permutation

$\pi$ , this is the number of indices

$i$ such that

$\pi(i)-\pi(i+1) > 1$ .
The generating functions of big descents is equal to the generating function of (normal) descents after sending a permutation from cycle to one-line notation Mp00090cycle-as-one-line notation, see [Theorem 2.5, 1].
For the number of small descents, see St000214The number of adjacencies of a permutation..

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.

Map

Ringel

Description

The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.