Identifier
-
Mp00223:
Permutations
—runsort⟶
Permutations
Mp00062: Permutations —Lehmer-code to major-code bijection⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001195: Dyck paths ⟶ ℤ
Values
[1,2,3] => [1,2,3] => [1,2,3] => [1,0,1,0,1,0] => 0
[1,3,2] => [1,3,2] => [3,1,2] => [1,1,1,0,0,0] => 1
[2,1,3] => [1,3,2] => [3,1,2] => [1,1,1,0,0,0] => 1
[2,3,1] => [1,2,3] => [1,2,3] => [1,0,1,0,1,0] => 0
[3,1,2] => [1,2,3] => [1,2,3] => [1,0,1,0,1,0] => 0
[3,2,1] => [1,2,3] => [1,2,3] => [1,0,1,0,1,0] => 0
[1,2,3,4] => [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0] => 0
[1,2,4,3] => [1,2,4,3] => [4,1,2,3] => [1,1,1,1,0,0,0,0] => 1
[1,3,2,4] => [1,3,2,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0] => 1
[1,3,4,2] => [1,3,4,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0] => 1
[1,4,2,3] => [1,4,2,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0] => 1
[1,4,3,2] => [1,4,2,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0] => 1
[2,1,3,4] => [1,3,4,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0] => 1
[2,1,4,3] => [1,4,2,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0] => 1
[2,3,1,4] => [1,4,2,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0] => 1
[2,3,4,1] => [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0] => 0
[2,4,1,3] => [1,3,2,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0] => 1
[2,4,3,1] => [1,2,4,3] => [4,1,2,3] => [1,1,1,1,0,0,0,0] => 1
[3,1,2,4] => [1,2,4,3] => [4,1,2,3] => [1,1,1,1,0,0,0,0] => 1
[3,1,4,2] => [1,4,2,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0] => 1
[3,2,1,4] => [1,4,2,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0] => 1
[3,2,4,1] => [1,2,4,3] => [4,1,2,3] => [1,1,1,1,0,0,0,0] => 1
[3,4,1,2] => [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0] => 0
[3,4,2,1] => [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0] => 0
[4,1,2,3] => [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0] => 0
[4,1,3,2] => [1,3,2,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0] => 1
[4,2,1,3] => [1,3,2,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0] => 1
[4,2,3,1] => [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0] => 0
[4,3,1,2] => [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0] => 0
[4,3,2,1] => [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0] => 0
[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] => 0
[1,2,3,5,4] => [1,2,3,5,4] => [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0] => 1
[1,2,4,3,5] => [1,2,4,3,5] => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0] => 1
[1,2,4,5,3] => [1,2,4,5,3] => [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0] => 1
[1,2,5,3,4] => [1,2,5,3,4] => [4,5,1,2,3] => [1,1,1,1,0,1,0,0,0,0] => 1
[1,2,5,4,3] => [1,2,5,3,4] => [4,5,1,2,3] => [1,1,1,1,0,1,0,0,0,0] => 1
[1,3,2,4,5] => [1,3,2,4,5] => [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0] => 1
[1,3,2,5,4] => [1,3,2,5,4] => [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0] => 1
[1,3,4,2,5] => [1,3,4,2,5] => [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0] => 1
[1,3,4,5,2] => [1,3,4,5,2] => [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0] => 1
[1,3,5,2,4] => [1,3,5,2,4] => [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0] => 1
[1,3,5,4,2] => [1,3,5,2,4] => [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0] => 1
[1,4,2,3,5] => [1,4,2,3,5] => [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0] => 1
[1,4,2,5,3] => [1,4,2,5,3] => [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0] => 1
[1,4,3,2,5] => [1,4,2,5,3] => [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0] => 1
[1,4,3,5,2] => [1,4,2,3,5] => [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0] => 1
[1,4,5,2,3] => [1,4,5,2,3] => [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0] => 1
[1,4,5,3,2] => [1,4,5,2,3] => [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0] => 1
[1,5,2,3,4] => [1,5,2,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 1
[1,5,2,4,3] => [1,5,2,4,3] => [5,3,4,1,2] => [1,1,1,1,1,0,0,0,0,0] => 1
[1,5,3,2,4] => [1,5,2,4,3] => [5,3,4,1,2] => [1,1,1,1,1,0,0,0,0,0] => 1
[1,5,3,4,2] => [1,5,2,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 1
[1,5,4,2,3] => [1,5,2,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 1
[1,5,4,3,2] => [1,5,2,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 1
[2,1,3,4,5] => [1,3,4,5,2] => [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0] => 1
[2,1,3,5,4] => [1,3,5,2,4] => [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0] => 1
[2,1,4,3,5] => [1,4,2,3,5] => [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0] => 1
[2,1,4,5,3] => [1,4,5,2,3] => [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0] => 1
[2,1,5,3,4] => [1,5,2,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 1
[2,1,5,4,3] => [1,5,2,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 1
[2,3,1,4,5] => [1,4,5,2,3] => [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0] => 1
[2,3,1,5,4] => [1,5,2,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 1
[2,3,4,1,5] => [1,5,2,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 1
[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] => 0
[2,3,5,1,4] => [1,4,2,3,5] => [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0] => 1
[2,3,5,4,1] => [1,2,3,5,4] => [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0] => 1
[2,4,1,3,5] => [1,3,5,2,4] => [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0] => 1
[2,4,1,5,3] => [1,5,2,4,3] => [5,3,4,1,2] => [1,1,1,1,1,0,0,0,0,0] => 1
[2,4,3,1,5] => [1,5,2,4,3] => [5,3,4,1,2] => [1,1,1,1,1,0,0,0,0,0] => 1
[2,4,3,5,1] => [1,2,4,3,5] => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0] => 1
[2,4,5,1,3] => [1,3,2,4,5] => [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0] => 1
[2,4,5,3,1] => [1,2,4,5,3] => [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0] => 1
[2,5,1,3,4] => [1,3,4,2,5] => [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0] => 1
[2,5,1,4,3] => [1,4,2,5,3] => [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0] => 1
[2,5,3,1,4] => [1,4,2,5,3] => [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0] => 1
[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] => 1
[2,5,4,1,3] => [1,3,2,5,4] => [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0] => 1
[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] => 1
[3,1,2,4,5] => [1,2,4,5,3] => [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0] => 1
[3,1,2,5,4] => [1,2,5,3,4] => [4,5,1,2,3] => [1,1,1,1,0,1,0,0,0,0] => 1
[3,1,4,2,5] => [1,4,2,5,3] => [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0] => 1
[3,1,4,5,2] => [1,4,5,2,3] => [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0] => 1
[3,1,5,2,4] => [1,5,2,4,3] => [5,3,4,1,2] => [1,1,1,1,1,0,0,0,0,0] => 1
[3,1,5,4,2] => [1,5,2,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 1
[3,2,1,4,5] => [1,4,5,2,3] => [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0] => 1
[3,2,1,5,4] => [1,5,2,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 1
[3,2,4,1,5] => [1,5,2,4,3] => [5,3,4,1,2] => [1,1,1,1,1,0,0,0,0,0] => 1
[3,2,4,5,1] => [1,2,4,5,3] => [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0] => 1
[3,2,5,1,4] => [1,4,2,5,3] => [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0] => 1
[3,2,5,4,1] => [1,2,5,3,4] => [4,5,1,2,3] => [1,1,1,1,0,1,0,0,0,0] => 1
[3,4,1,2,5] => [1,2,5,3,4] => [4,5,1,2,3] => [1,1,1,1,0,1,0,0,0,0] => 1
[3,4,1,5,2] => [1,5,2,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 1
[3,4,2,1,5] => [1,5,2,3,4] => [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0] => 1
[3,4,2,5,1] => [1,2,5,3,4] => [4,5,1,2,3] => [1,1,1,1,0,1,0,0,0,0] => 1
[3,4,5,1,2] => [1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0] => 0
[3,4,5,2,1] => [1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0] => 0
[3,5,1,2,4] => [1,2,4,3,5] => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0] => 1
[3,5,1,4,2] => [1,4,2,3,5] => [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0] => 1
[3,5,2,1,4] => [1,4,2,3,5] => [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0] => 1
[3,5,2,4,1] => [1,2,4,3,5] => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0] => 1
[3,5,4,1,2] => [1,2,3,5,4] => [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0] => 1
>>> Load all 150 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
Description
The global dimension of the algebra A/AfA of the corresponding Nakayama algebra A with minimal left faithful projective-injective module Af.
Map
runsort
Description
The permutation obtained by sorting the increasing runs lexicographically.
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 σ is given by L(σ)=l1…ln with li=#{j>i:σj<σi}. In particular, li is the number of boxes in the i-th column of the Rothe diagram. For example, the Lehmer code of σ=[4,3,1,5,2] is 32010. The Lehmer code L:Sn ˜⟶ Sn is a bijection between permutations of size n and sequences l1…ln∈Nn with li≤i.
* The major code M(σ) of a permutation σ∈Sn is a way to encode a permutation as a sequence m1m2…mn with mi≥i. To define mi, let deli(σ) be the normalized permutation obtained by removing all σj<i from the one-line notation of σ. The i-th index is then given by
mi=maj(deli(σ))−maj(deli−1(σ)).
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
maj([8,2,4,6,1,3,5,7])=5,maj([7,1,3,5,2,4,6])=5,maj([6,2,4,1,3,5])=4,
maj([5,1,3,2,4])=4,maj([4,2,1,3])=3,maj([3,1,2])=1,maj([2,1])=1.
Observe that the sum of the major code of σ equals the major index of σ.
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 σ is given by L(σ)=l1…ln with li=#{j>i:σj<σi}. In particular, li is the number of boxes in the i-th column of the Rothe diagram. For example, the Lehmer code of σ=[4,3,1,5,2] is 32010. The Lehmer code L:Sn ˜⟶ Sn is a bijection between permutations of size n and sequences l1…ln∈Nn with li≤i.
* The major code M(σ) of a permutation σ∈Sn is a way to encode a permutation as a sequence m1m2…mn with mi≥i. To define mi, let deli(σ) be the normalized permutation obtained by removing all σj<i from the one-line notation of σ. The i-th index is then given by
mi=maj(deli(σ))−maj(deli−1(σ)).
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
maj([8,2,4,6,1,3,5,7])=5,maj([7,1,3,5,2,4,6])=5,maj([6,2,4,1,3,5])=4,
maj([5,1,3,2,4])=4,maj([4,2,1,3])=3,maj([3,1,2])=1,maj([2,1])=1.
Observe that the sum of the major code of σ equals the major index of σ.
Map
left-to-right-maxima to Dyck path
Description
The left-to-right maxima of a permutation as a Dyck path.
Let (c1,…,ck) be the rise composition Mp00102rise composition of the path. Then the corresponding left-to-right maxima are c1,c1+c2,…,c1+⋯+ck.
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.
Let (c1,…,ck) be the rise composition Mp00102rise composition of the path. Then the corresponding left-to-right maxima are c1,c1+c2,…,c1+⋯+ck.
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.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!