- FindStat

Identifier

Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00062: Permutations —Lehmer-code to major-code bijection⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001206: Dyck paths ⟶ ℤ (values match St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$ .)

Values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 720 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_{2} = 2\ q^{2}$

Description

The maximal dimension of an indecomposable projective

$eAe$ -module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module

$eA$ .

Map

left-to-right-maxima to Dyck path

Description

The left-to-right maxima of a permutation as a Dyck path.
Let

$(c_1, \dots, c_k)$ be the rise composition Mp00102rise composition of the path. Then the corresponding left-to-right maxima are

$c_1, c_1+c_2, \dots, c_1+\dots+c_k$ .
Restricted to 321-avoiding permutations, this is the inverse of Mp00119to 321-avoiding permutation (Krattenthaler), restricted to 312-avoiding permutations, this is the inverse of Mp00031to 312-avoiding permutation.

Map

cycle-as-one-line notation

Description

Return the permutation obtained by concatenating the cycles of a permutation, each written with minimal element first, sorted by minimal element.

Map

Lehmer-code to major-code bijection

Description

Sends a permutation to the unique permutation such that the Lehmer code is sent to the major code.
The Lehmer code encodes the inversions of a permutation and the major code encodes its major index. In particular, the number of inversions of a permutation equals the major index of its image under this map.
* The Lehmer code of a permutation

$\sigma$ is given by

$L(\sigma) = l_1 \ldots l_n$ with

$l_i = \# \{ j > i : \sigma_j < \sigma_i \}$ . In particular,

$l_i$ is the number of boxes in the

$i$ -th column of the Rothe diagram. For example, the Lehmer code of

$\sigma = [4,3,1,5,2]$ is

$32010$ . The Lehmer code

$L : \mathfrak{S}_n\ \tilde\longrightarrow\ S_n$ is a bijection between permutations of size

$n$ and sequences

$l_1\ldots l_n \in \mathbf{N}^n$ with

$l_i \leq i$ .
* The major code

$M(\sigma)$ of a permutation

$\sigma \in \mathfrak{S}_n$ is a way to encode a permutation as a sequence

$m_1 m_2 \ldots m_n$ with

$m_i \geq i$ . To define

$m_i$ , let

$\operatorname{del}_i(\sigma)$ be the normalized permutation obtained by removing all

$\sigma_j < i$ from the one-line notation of

$\sigma$ . The

$i$ -th index is then given by

$m_i = \operatorname{maj}(\operatorname{del}_i(\sigma)) - \operatorname{maj}(\operatorname{del}_{i-1}(\sigma)).$
For example, the permutation

$[9,3,5,7,2,1,4,6,8]$ has major code

$[5, 0, 1, 0, 1, 2, 0, 1, 0]$ since

$\operatorname{maj}([8,2,4,6,1,3,5,7]) = 5, \quad \operatorname{maj}([7,1,3,5,2,4,6]) = 5, \quad \operatorname{maj}([6,2,4,1,3,5]) = 4,$

$\operatorname{maj}([5,1,3,2,4]) = 4, \quad \operatorname{maj}([4,2,1,3]) = 3, \quad \operatorname{maj}([3,1,2]) = 1, \quad \operatorname{maj}([2,1]) = 1.$
Observe that the sum of the major code of

$\sigma$ equals the major index of

$\sigma$ .