Identifier
-
Mp00023:
Dyck paths
—to non-crossing permutation⟶
Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
Mp00237: Permutations —descent views to invisible inversion bottoms⟶ Permutations
St000996: Permutations ⟶ ℤ
Values
[1,0] => [1] => [1] => [1] => 0
[1,0,1,0] => [1,2] => [1,2] => [1,2] => 0
[1,1,0,0] => [2,1] => [2,1] => [2,1] => 1
[1,0,1,0,1,0] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,0,1,1,0,0] => [1,3,2] => [2,3,1] => [3,2,1] => 1
[1,1,0,0,1,0] => [2,1,3] => [2,1,3] => [2,1,3] => 1
[1,1,0,1,0,0] => [2,3,1] => [3,1,2] => [3,1,2] => 1
[1,1,1,0,0,0] => [3,2,1] => [3,2,1] => [2,3,1] => 2
[1,0,1,0,1,0,1,0] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0] => [1,2,4,3] => [2,3,4,1] => [4,2,3,1] => 1
[1,0,1,1,0,0,1,0] => [1,3,2,4] => [2,3,1,4] => [3,2,1,4] => 1
[1,0,1,1,0,1,0,0] => [1,3,4,2] => [2,4,1,3] => [4,2,1,3] => 1
[1,0,1,1,1,0,0,0] => [1,4,3,2] => [3,4,2,1] => [2,4,3,1] => 2
[1,1,0,0,1,0,1,0] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 1
[1,1,0,0,1,1,0,0] => [2,1,4,3] => [3,2,4,1] => [4,3,2,1] => 1
[1,1,0,1,0,0,1,0] => [2,3,1,4] => [3,1,2,4] => [3,1,2,4] => 1
[1,1,0,1,0,1,0,0] => [2,3,4,1] => [4,1,2,3] => [4,1,2,3] => 1
[1,1,0,1,1,0,0,0] => [2,4,3,1] => [4,2,3,1] => [3,4,2,1] => 2
[1,1,1,0,0,0,1,0] => [3,2,1,4] => [3,2,1,4] => [2,3,1,4] => 2
[1,1,1,0,0,1,0,0] => [3,2,4,1] => [4,2,1,3] => [2,4,1,3] => 2
[1,1,1,0,1,0,0,0] => [4,2,3,1] => [4,1,3,2] => [4,3,1,2] => 1
[1,1,1,1,0,0,0,0] => [4,3,2,1] => [4,3,2,1] => [2,3,4,1] => 3
[1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [2,3,4,5,1] => [5,2,3,4,1] => 1
[1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [2,3,4,1,5] => [4,2,3,1,5] => 1
[1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => [2,3,5,1,4] => [5,2,3,1,4] => 1
[1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [3,4,5,2,1] => [2,5,3,4,1] => 2
[1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [2,3,1,4,5] => [3,2,1,4,5] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [3,4,2,5,1] => [5,4,3,2,1] => 1
[1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => [2,4,1,3,5] => [4,2,1,3,5] => 1
[1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => [2,5,1,3,4] => [5,2,1,3,4] => 1
[1,0,1,1,0,1,1,0,0,0] => [1,3,5,4,2] => [3,5,2,4,1] => [4,5,3,2,1] => 2
[1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [3,4,2,1,5] => [2,4,3,1,5] => 2
[1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => [3,5,2,1,4] => [2,5,3,1,4] => 2
[1,0,1,1,1,0,1,0,0,0] => [1,5,3,4,2] => [3,5,1,4,2] => [5,4,3,1,2] => 1
[1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [4,5,3,2,1] => [2,3,5,4,1] => 3
[1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [3,2,4,5,1] => [5,3,2,4,1] => 1
[1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [3,2,4,1,5] => [4,3,2,1,5] => 1
[1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => [3,2,5,1,4] => [5,3,2,1,4] => 1
[1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [4,3,5,2,1] => [2,5,4,3,1] => 2
[1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => [3,1,2,4,5] => [3,1,2,4,5] => 1
[1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => [4,2,3,5,1] => [5,4,2,3,1] => 1
[1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => [4,1,2,3,5] => [4,1,2,3,5] => 1
[1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [5,1,2,3,4] => [5,1,2,3,4] => 1
[1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => [5,2,3,4,1] => [4,5,2,3,1] => 2
[1,1,0,1,1,0,0,0,1,0] => [2,4,3,1,5] => [4,2,3,1,5] => [3,4,2,1,5] => 2
[1,1,0,1,1,0,0,1,0,0] => [2,4,3,5,1] => [5,2,3,1,4] => [3,5,2,1,4] => 2
[1,1,0,1,1,0,1,0,0,0] => [2,5,3,4,1] => [5,2,1,4,3] => [2,5,4,1,3] => 2
[1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => [5,3,4,2,1] => [2,4,5,3,1] => 3
[1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => [3,2,1,4,5] => [2,3,1,4,5] => 2
[1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [4,3,2,5,1] => [5,3,4,2,1] => 1
[1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => [4,2,1,3,5] => [2,4,1,3,5] => 2
[1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => [5,2,1,3,4] => [2,5,1,3,4] => 2
[1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => [5,3,2,4,1] => [4,3,5,2,1] => 2
[1,1,1,0,1,0,0,0,1,0] => [4,2,3,1,5] => [4,1,3,2,5] => [4,3,1,2,5] => 1
[1,1,1,0,1,0,0,1,0,0] => [4,2,3,5,1] => [5,1,3,2,4] => [5,3,1,2,4] => 1
[1,1,1,0,1,0,1,0,0,0] => [5,2,3,4,1] => [5,1,2,4,3] => [5,1,4,2,3] => 1
[1,1,1,0,1,1,0,0,0,0] => [5,2,4,3,1] => [5,2,4,3,1] => [3,4,5,1,2] => 3
[1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => [4,3,2,1,5] => [2,3,4,1,5] => 3
[1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => [5,3,2,1,4] => [2,3,5,1,4] => 3
[1,1,1,1,0,0,1,0,0,0] => [5,3,2,4,1] => [5,3,1,4,2] => [3,5,4,2,1] => 2
[1,1,1,1,0,1,0,0,0,0] => [5,3,4,2,1] => [5,4,1,3,2] => [4,3,1,5,2] => 2
[1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => [5,4,3,2,1] => [2,3,4,5,1] => 4
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => [1,2,3,4,5,6] => [1,2,3,4,5,6] => 0
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => [2,3,4,5,6,1] => [6,2,3,4,5,1] => 1
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => [2,3,4,5,1,6] => [5,2,3,4,1,6] => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,2,3,5,6,4] => [2,3,4,6,1,5] => [6,2,3,4,1,5] => 1
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => [3,4,5,6,2,1] => [2,6,3,4,5,1] => 2
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => [2,3,4,1,5,6] => [4,2,3,1,5,6] => 1
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [3,4,5,2,6,1] => [6,5,3,4,2,1] => 1
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,4,5,3,6] => [2,3,5,1,4,6] => [5,2,3,1,4,6] => 1
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,2,4,5,6,3] => [2,3,6,1,4,5] => [6,2,3,1,4,5] => 1
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,2,4,6,5,3] => [3,4,6,2,5,1] => [5,6,3,4,2,1] => 2
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => [3,4,5,2,1,6] => [2,5,3,4,1,6] => 2
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,2,5,4,6,3] => [3,4,6,2,1,5] => [2,6,3,4,1,5] => 2
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,2,6,4,5,3] => [3,4,6,1,5,2] => [6,5,3,4,1,2] => 1
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => [4,5,6,3,2,1] => [2,3,6,4,5,1] => 3
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => [2,3,1,4,5,6] => [3,2,1,4,5,6] => 1
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => [3,4,2,5,6,1] => [6,4,3,2,5,1] => 1
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [3,4,2,5,1,6] => [5,4,3,2,1,6] => 1
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,3,2,5,6,4] => [3,4,2,6,1,5] => [6,4,3,2,1,5] => 1
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [4,5,3,6,2,1] => [2,6,5,4,3,1] => 2
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,3,4,2,5,6] => [2,4,1,3,5,6] => [4,2,1,3,5,6] => 1
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,3,4,2,6,5] => [3,5,2,4,6,1] => [6,5,3,2,4,1] => 1
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,3,4,5,2,6] => [2,5,1,3,4,6] => [5,2,1,3,4,6] => 1
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,3,4,5,6,2] => [2,6,1,3,4,5] => [6,2,1,3,4,5] => 1
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,3,4,6,5,2] => [3,6,2,4,5,1] => [5,6,3,2,4,1] => 2
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,4,2,6] => [3,5,2,4,1,6] => [4,5,3,2,1,6] => 2
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,3,5,4,6,2] => [3,6,2,4,1,5] => [4,6,3,2,1,5] => 2
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,3,6,4,5,2] => [3,6,2,1,5,4] => [2,6,3,5,1,4] => 2
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,5,4,2] => [4,6,3,5,2,1] => [2,5,6,4,3,1] => 3
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => [3,4,2,1,5,6] => [2,4,3,1,5,6] => 2
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => [4,5,3,2,6,1] => [6,3,5,4,2,1] => 1
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,3,5,2,6] => [3,5,2,1,4,6] => [2,5,3,1,4,6] => 2
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,4,3,5,6,2] => [3,6,2,1,4,5] => [2,6,3,1,4,5] => 2
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,4,3,6,5,2] => [4,6,3,2,5,1] => [5,3,6,4,2,1] => 2
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,5,3,4,2,6] => [3,5,1,4,2,6] => [5,4,3,1,2,6] => 1
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,5,3,4,6,2] => [3,6,1,4,2,5] => [6,4,3,1,2,5] => 1
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,6,3,4,5,2] => [3,6,1,2,5,4] => [6,1,3,5,2,4] => 1
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,6,3,5,4,2] => [4,6,2,5,3,1] => [3,5,6,4,1,2] => 3
>>> Load all 331 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 number of exclusive left-to-right maxima of a permutation.
This is the number of left-to-right maxima that are not right-to-left minima.
This is the number of left-to-right maxima that are not right-to-left minima.
Map
to non-crossing permutation
Description
Sends a Dyck path D with valley at positions {(i1,j1),…,(ik,jk)} to the unique non-crossing permutation π having descents {i1,…,ik} and whose inverse has descents {j1,…,jk}.
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..
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
major-index to inversion-number bijection
Description
Return the permutation whose Lehmer code equals the major code of the preimage.
This map sends the major index to the number of inversions.
This map sends the major index to the number of inversions.
Map
descent views to invisible inversion bottoms
Description
Return a permutation whose multiset of invisible inversion bottoms is the multiset of descent views of the given permutation.
This map is similar to Mp00235descent views to invisible inversion bottoms, but different beginning with permutations of six elements.
An invisible inversion of a permutation σ is a pair i<j such that i<σ(j)<σ(i). The element σ(j) is then an invisible inversion bottom.
A descent view in a permutation π is an element π(j) such that π(i+1)<π(j)<π(i), and additionally the smallest element in the decreasing run containing π(i) is smaller than the smallest element in the decreasing run containing π(j).
This map is a bijection χ:Sn→Sn, such that
This map is similar to Mp00235descent views to invisible inversion bottoms, but different beginning with permutations of six elements.
An invisible inversion of a permutation σ is a pair i<j such that i<σ(j)<σ(i). The element σ(j) is then an invisible inversion bottom.
A descent view in a permutation π is an element π(j) such that π(i+1)<π(j)<π(i), and additionally the smallest element in the decreasing run containing π(i) is smaller than the smallest element in the decreasing run containing π(j).
This map is a bijection χ:Sn→Sn, such that
- the multiset of descent views in π is the multiset of invisible inversion bottoms in χ(π),
- the set of left-to-right maximima of π is the set of maximal elements in the cycles of χ(π),
- the set of global ascent of π is the set of global ascent of χ(π),
- the set of maximal elements in the decreasing runs of π is the set of deficiency positions of χ(π), and
- the set of minimal elements in the decreasing runs of π is the set of deficiency values of χ(π).
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!