- FindStat

Identifier

Mp00248: Permutations —DEX composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001161: Dyck paths ⟶ ℤ

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 10521 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 major index north count of a Dyck path.
The descent set $\operatorname{des}(D)$ of a Dyck path $D = D_1 \cdots D_{2n}$ with $D_i \in \{N,E\}$ is given by all indices $i$ such that $D_i = E$ and $D_{i+1} = N$. This is, the positions of the valleys of $D$.
The major index of a Dyck path is then the sum of the positions of the valleys, $\sum_{i \in \operatorname{des}(D)} i$, see St000027The major index of a Dyck path..
The major index north count is given by $\sum_{i \in \operatorname{des}(D)} \#\{ j \leq i \mid D_j = N\}$.

Map

DEX composition

Description

The DEX composition of a permutation.
Let $\pi$ be a permutation in $\mathfrak S_n$. Let $\bar\pi$ be the word in the ordered set $\bar 1 < \dots < \bar n < 1 \dots < n$ obtained from $\pi$ by replacing every excedance $\pi(i) > i$ by $\overline{\pi(i)}$. Then the DEX set of $\pi$ is the set of indices $1 \leq i < n$ such that $\bar\pi(i) > \bar\pi(i+1)$. Finally, the DEX composition $c_1, \dots, c_k$ of $n$ corresponds to the DEX subset $\{c_1, c_1 + c_2, \dots, c_1 + \dots + c_{k-1}\}$.
The (quasi)symmetric function
$$ \sum_{\pi\in\mathfrak S_{\lambda, j}} F_{DEX(\pi)}, $$
where the sum is over the set of permutations of cycle type $\lambda$ with $j$ excedances, is the Eulerian quasisymmetric function.

Map

bounce path

Description

The bounce path determined by an integer composition.