- FindStat

Identifier

Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing 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] => [1,0,1,0] => [1,2] => 1

[2] => [1,1,0,0,1,0] => [2,1,3] => 2

[1,1] => [1,0,1,1,0,0] => [1,3,2] => 2

[3] => [1,1,1,0,0,0,1,0] => [3,2,1,4] => 3

[2,1] => [1,0,1,0,1,0] => [1,2,3] => 3

[1,1,1] => [1,0,1,1,1,0,0,0] => [1,4,3,2] => 3

[4] => [1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => 4

[3,1] => [1,1,0,1,0,0,1,0] => [2,3,1,4] => 4

[2,2] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 4

[2,1,1] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => 4

[1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => 4

[5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5,4,3,2,1,6] => 5

[4,1] => [1,1,1,0,1,0,0,0,1,0] => [4,2,3,1,5] => 5

[3,2] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 5

[3,1,1] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => 5

[2,2,1] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 5

[2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => [1,5,3,4,2] => 5

[1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,6,5,4,3,2] => 5

[6] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [6,5,4,3,2,1,7] => 6

[5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [5,3,4,2,1,6] => 6

[4,2] => [1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => 6

[4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [2,4,3,1,5] => 6

[3,3] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => 6

[3,2,1] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 6

[3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => 6

[2,2,2] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => 6

[2,2,1,1] => [1,0,1,1,0,1,1,0,0,0] => [1,3,5,4,2] => 6

[2,1,1,1,1] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,6,4,5,3,2] => 6

[1,1,1,1,1,1] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,7,6,5,4,3,2] => 6

[7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0] => [7,6,5,4,3,2,1,8] => 7

[6,1] => [1,1,1,1,1,0,1,0,0,0,0,0,1,0] => [6,5,3,4,2,1,7] => 7

[5,2] => [1,1,1,1,0,0,1,0,0,0,1,0] => [5,3,2,4,1,6] => 7

[5,1,1] => [1,1,1,0,1,1,0,0,0,0,1,0] => [5,2,4,3,1,6] => 7

[4,3] => [1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => 7

[4,2,1] => [1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => 7

[4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => 7

[3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => 7

[3,2,2] => [1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => 7

[3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => 7

[3,1,1,1,1] => [1,0,1,1,1,1,0,0,1,0,0,0] => [1,6,4,3,5,2] => 7

[2,2,2,1] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => 7

[2,2,1,1,1] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,6,3,5,4,2] => 7

[2,1,1,1,1,1] => [1,0,1,1,1,1,1,0,1,0,0,0,0,0] => [1,7,6,4,5,3,2] => 7

[1,1,1,1,1,1,1] => [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,8,7,6,5,4,3,2] => 7

[8] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0] => [8,7,6,5,4,3,2,1,9] => 8

[7,1] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0,1,0] => [7,6,4,5,3,2,1,8] => 8

[6,2] => [1,1,1,1,1,0,0,1,0,0,0,0,1,0] => [6,4,3,5,2,1,7] => 8

[6,1,1] => [1,1,1,1,0,1,1,0,0,0,0,0,1,0] => [6,3,5,4,2,1,7] => 8

[5,3] => [1,1,1,1,0,0,0,1,0,0,1,0] => [4,3,2,5,1,6] => 8

[5,2,1] => [1,1,1,0,1,0,1,0,0,0,1,0] => [5,2,3,4,1,6] => 8

[5,1,1,1] => [1,1,0,1,1,1,0,0,0,0,1,0] => [2,5,4,3,1,6] => 8

[4,4] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,3,2,1,6,5] => 8

[4,3,1] => [1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => 8

[4,2,2] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => 8

[4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => 8

[4,1,1,1,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,5,4,3,6,2] => 8

[3,3,2] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => 8

[3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => 8

[3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => 8

[3,2,1,1,1] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,6,3,4,5,2] => 8

[3,1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,1,0,0,0,0] => [1,7,5,4,6,3,2] => 8

[2,2,2,2] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,5,4,3] => 8

[2,2,2,1,1] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,5,4,2] => 8

[2,2,1,1,1,1] => [1,0,1,1,1,1,0,1,1,0,0,0,0,0] => [1,7,4,6,5,3,2] => 8

[2,1,1,1,1,1,1] => [1,0,1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [1,8,7,5,6,4,3,2] => 8

[1,1,1,1,1,1,1,1] => [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [1,9,8,7,6,5,4,3,2] => 8

[9] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0] => [9,8,7,6,5,4,3,2,1,10] => 9

[8,1] => [1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,1,0] => [8,7,6,4,5,3,2,1,9] => 9

[7,2] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0,1,0] => [7,6,4,3,5,2,1,8] => 9

[7,1,1] => [1,1,1,1,1,0,1,1,0,0,0,0,0,0,1,0] => [7,6,3,5,4,2,1,8] => 9

[6,3] => [1,1,1,1,1,0,0,0,1,0,0,0,1,0] => [6,4,3,2,5,1,7] => 9

[6,2,1] => [1,1,1,1,0,1,0,1,0,0,0,0,1,0] => [6,3,4,5,2,1,7] => 9

[6,1,1,1] => [1,1,1,0,1,1,1,0,0,0,0,0,1,0] => [6,2,5,4,3,1,7] => 9

[5,4] => [1,1,1,1,0,0,0,0,1,0,1,0] => [4,3,2,1,5,6] => 9

[5,3,1] => [1,1,1,0,1,0,0,1,0,0,1,0] => [4,2,3,5,1,6] => 9

[5,2,2] => [1,1,1,0,0,1,1,0,0,0,1,0] => [3,2,5,4,1,6] => 9

[5,2,1,1] => [1,1,0,1,1,0,1,0,0,0,1,0] => [2,5,3,4,1,6] => 9

[5,1,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,4,3,2,6] => 9

[4,4,1] => [1,1,1,0,1,0,0,0,1,1,0,0] => [4,2,3,1,6,5] => 9

[4,3,2] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => 9

[4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => 9

[4,2,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => 9

[4,2,1,1,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,5,3,4,6,2] => 9

[4,1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,1,0,0,0] => [1,7,5,4,3,6,2] => 9

[3,3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,2,1,6,5,4] => 9

[3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => 9

[3,3,1,1,1] => [1,0,1,1,1,0,0,1,1,0,0,0] => [1,4,3,6,5,2] => 9

[3,2,2,2] => [1,1,0,0,1,1,1,0,1,0,0,0] => [2,1,6,4,5,3] => 9

[3,2,2,1,1] => [1,0,1,1,0,1,1,0,1,0,0,0] => [1,3,6,4,5,2] => 9

[3,2,1,1,1,1] => [1,0,1,1,1,1,0,1,0,1,0,0,0,0] => [1,7,4,5,6,3,2] => 9

[3,1,1,1,1,1,1] => [1,0,1,1,1,1,1,1,0,0,1,0,0,0,0,0] => [1,8,7,5,4,6,3,2] => 9

[2,2,2,2,1] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => 9

[2,2,2,1,1,1] => [1,0,1,1,1,0,1,1,1,0,0,0,0,0] => [1,7,3,6,5,4,2] => 9

[2,2,1,1,1,1,1] => [1,0,1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [1,8,7,4,6,5,3,2] => 9

[2,1,1,1,1,1,1,1] => [1,0,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0] => [1,9,8,7,5,6,4,3,2] => 9

[1,1,1,1,1,1,1,1,1] => [1,0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [1,10,9,8,7,6,5,4,3,2] => 9

[10] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0] => [10,9,8,7,6,5,4,3,2,1,11] => 10

[9,1] => [1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0,1,0] => [9,8,7,5,6,4,3,2,1,10] => 10

[8,2] => [1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,1,0] => [8,7,5,4,6,3,2,1,9] => 10

[8,1,1] => [1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,1,0] => [8,7,4,6,5,3,2,1,9] => 10

[7,3] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0,1,0] => [7,5,4,3,6,2,1,8] => 10

>>> Load all 257 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

click to show known generating functions

$F_{1} = q$

$F_{2} = 2\ q^{2}$

$F_{3} = 3\ q^{3}$

$F_{4} = 5\ q^{4}$

$F_{5} = 7\ q^{5}$

$F_{6} = 11\ q^{6}$

$F_{7} = 15\ q^{7}$

$F_{8} = 22\ q^{8}$

$F_{9} = 30\ q^{9}$

$F_{10} = 42\ q^{10}$

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)$ .

Map

to non-crossing permutation

Description

Sends a Dyck path

$D$ with valley at positions

$\{(i_1,j_1),\ldots,(i_k,j_k)\}$ to the unique non-crossing permutation

$\pi$ having descents

$\{i_1,\ldots,i_k\}$ and whose inverse has descents

$\{j_1,\ldots,j_k\}$ .
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to

$n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..

Map

to Dyck path

Description

Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.