- FindStat

Identifier

Mp00056: Parking functions —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,1] => [1,1,0,0] => [2,1] => 0

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 18248 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} = 1$

$F_{2} = 1 + 2\ q$

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

$F_{4} = 1 + 4\ q + 10\ q^{2} + 20\ q^{3} + 30\ q^{4} + 36\ q^{5} + 24\ q^{6}$

$F_{5} = 1 + 5\ q + 15\ q^{2} + 35\ q^{3} + 70\ q^{4} + 120\ q^{5} + 180\ q^{6} + 240\ q^{7} + 270\ q^{8} + 240\ q^{9} + 120\ q^{10}$

$F_{6} = 1 + 6\ q + 21\ q^{2} + 56\ q^{3} + 126\ q^{4} + 252\ q^{5} + 455\ q^{6} + 750\ q^{7} + 1140\ q^{8} + 1610\ q^{9} + 2100\ q^{10} + 2520\ q^{11} + 2730\ q^{12} + 2520\ q^{13} + 1800\ q^{14} + 720\ q^{15}$

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 parking function to its support Dyck word.