- FindStat

Identifier

Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000530: Permutations ⟶ ℤ

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Description

The number of permutations with the same descent word as the given permutation.
The descent word of a permutation is the binary word given by Mp00109descent word. For a given permutation, this statistic is the number of permutations with the same descent word, so the number of elements in the fiber of the map Mp00109descent word containing a given permutation.
This statistic appears as up-down analysis in statistical applications in genetics, see [1] and the references therein.

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

bounce path

Description

The bounce path determined by an integer composition.

Map

descent composition

Description

The descent composition of a permutation.
The descent composition of a permutation $\pi$ of length $n$ is the integer composition of $n$ whose descent set equals the descent set of $\pi$. The descent set of a permutation $\pi$ is $\{i \mid 1 \leq i < n, \pi(i) > \pi(i+1)\}$. The descent set of a composition $c = (i_1, i_2, \ldots, i_k)$ is the set $\{ i_1, i_1 + i_2, i_1 + i_2 + i_3, \ldots, i_1 + i_2 + \cdots + i_{k-1} \}$.