Identifier
-
Mp00254:
Permutations
—Inverse fireworks map⟶
Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001232: Dyck paths ⟶ ℤ
Values
[1] => [1] => [1,0] => [1,0] => 0
[1,2] => [1,2] => [1,0,1,0] => [1,1,0,0] => 0
[2,1] => [2,1] => [1,1,0,0] => [1,0,1,0] => 1
[1,2,3] => [1,2,3] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => 0
[1,3,2] => [1,3,2] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 2
[2,1,3] => [2,1,3] => [1,1,0,0,1,0] => [1,1,0,0,1,0] => 1
[2,3,1] => [1,3,2] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 2
[1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => 0
[1,2,4,3] => [1,2,4,3] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => 3
[1,3,2,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 2
[1,3,4,2] => [1,2,4,3] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => 3
[2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0] => 1
[2,3,1,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 2
[2,3,4,1] => [1,2,4,3] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => 3
[1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => 0
[1,2,3,5,4] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => 4
[1,2,4,3,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,0] => 3
[1,2,4,5,3] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => 4
[1,3,2,4,5] => [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[1,3,4,2,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,0] => 3
[1,3,4,5,2] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => 4
[2,1,3,4,5] => [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => 1
[2,3,1,4,5] => [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[2,3,4,1,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,0] => 3
[2,3,4,5,1] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => 4
[1,2,3,4,5,6] => [1,2,3,4,5,6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => 0
[1,2,3,4,6,5] => [1,2,3,4,6,5] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 5
[1,2,3,5,4,6] => [1,2,3,5,4,6] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 4
[1,2,3,5,6,4] => [1,2,3,4,6,5] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 5
[1,2,4,3,5,6] => [1,2,4,3,5,6] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 3
[1,2,4,5,3,6] => [1,2,3,5,4,6] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 4
[1,2,4,5,6,3] => [1,2,3,4,6,5] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 5
[1,3,2,4,5,6] => [1,3,2,4,5,6] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 2
[1,3,4,2,5,6] => [1,2,4,3,5,6] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 3
[1,3,4,5,2,6] => [1,2,3,5,4,6] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 4
[1,3,4,5,6,2] => [1,2,3,4,6,5] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 5
[2,1,3,4,5,6] => [2,1,3,4,5,6] => [1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 1
[2,3,1,4,5,6] => [1,3,2,4,5,6] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 2
[2,3,4,1,5,6] => [1,2,4,3,5,6] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 3
[2,3,4,5,1,6] => [1,2,3,5,4,6] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 4
[2,3,4,5,6,1] => [1,2,3,4,6,5] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 5
[1,2,3,4,5,6,7] => [1,2,3,4,5,6,7] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => 0
[1,2,3,4,5,7,6] => [1,2,3,4,5,7,6] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => 6
[1,2,3,4,6,5,7] => [1,2,3,4,6,5,7] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0] => 5
[1,2,3,4,6,7,5] => [1,2,3,4,5,7,6] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => 6
[1,2,3,5,4,6,7] => [1,2,3,5,4,6,7] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0] => 4
[1,2,3,5,6,4,7] => [1,2,3,4,6,5,7] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0] => 5
[1,2,3,5,6,7,4] => [1,2,3,4,5,7,6] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => 6
[1,2,4,3,5,6,7] => [1,2,4,3,5,6,7] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,1,0,0,0] => 3
[1,2,4,5,3,6,7] => [1,2,3,5,4,6,7] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0] => 4
[1,2,4,5,6,3,7] => [1,2,3,4,6,5,7] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0] => 5
[1,2,4,5,6,7,3] => [1,2,3,4,5,7,6] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => 6
[1,3,2,4,5,6,7] => [1,3,2,4,5,6,7] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0] => 2
[1,3,4,2,5,6,7] => [1,2,4,3,5,6,7] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,1,0,0,0] => 3
[1,3,4,5,2,6,7] => [1,2,3,5,4,6,7] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0] => 4
[1,3,4,5,6,2,7] => [1,2,3,4,6,5,7] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0] => 5
[1,3,4,5,6,7,2] => [1,2,3,4,5,7,6] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => 6
[2,1,3,4,5,6,7] => [2,1,3,4,5,6,7] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => 1
[2,3,1,4,5,6,7] => [1,3,2,4,5,6,7] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,1,0,0] => 2
[2,3,4,1,5,6,7] => [1,2,4,3,5,6,7] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,1,0,0,0] => 3
[2,3,4,5,1,6,7] => [1,2,3,5,4,6,7] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,1,0,0,0,0] => 4
[2,3,4,5,6,1,7] => [1,2,3,4,6,5,7] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,1,1,0,0,1,0,0,0,0,0] => 5
[2,3,4,5,6,7,1] => [1,2,3,4,5,7,6] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => 6
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 number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Map
Inverse fireworks map
Description
Sends a permutation to an inverse fireworks permutation.
A permutation σ is inverse fireworks if its inverse avoids the vincular pattern 3−12. The inverse fireworks map sends any permutation σ to an inverse fireworks permutation that is below σ in left weak order and has the same Rajchgot index St001759The Rajchgot index of a permutation..
A permutation σ is inverse fireworks if its inverse avoids the vincular pattern 3−12. The inverse fireworks map sends any permutation σ to an inverse fireworks permutation that is below σ in left weak order and has the same Rajchgot index St001759The Rajchgot index of a permutation..
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.
Map
decomposition reverse
Description
This map is recursively defined as follows.
The unique empty path of semilength 0 is sent to itself.
Let D be a Dyck path of semilength n>0 and decompose it into 1D10D2 with Dyck paths D1,D2 of respective semilengths n1 and n2 such that n1 is minimal. One then has n1+n2=n−1.
Now let ˜D1 and ˜D2 be the recursively defined respective images of D1 and D2 under this map. The image of D is then defined as 1˜D20˜D1.
The unique empty path of semilength 0 is sent to itself.
Let D be a Dyck path of semilength n>0 and decompose it into 1D10D2 with Dyck paths D1,D2 of respective semilengths n1 and n2 such that n1 is minimal. One then has n1+n2=n−1.
Now let ˜D1 and ˜D2 be the recursively defined respective images of D1 and D2 under this map. The image of D is then defined as 1˜D20˜D1.
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!