searching the database
Your data matches 16 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000991
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000991: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000991: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 1
[1,0,1,0]
=> [1,2] => [1,2] => 2
[1,1,0,0]
=> [2,1] => [1,2] => 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 3
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => 3
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => 3
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => 3
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => 3
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => 4
Description
The number of right-to-left minima of a permutation.
For the number of left-to-right maxima, see [[St000314]].
Matching statistic: St000007
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00069: Permutations —complement⟶ Permutations
St000007: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00069: Permutations —complement⟶ Permutations
St000007: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 1
[1,0,1,0]
=> [1,2] => [1,2] => [2,1] => 2
[1,1,0,0]
=> [2,1] => [1,2] => [2,1] => 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [3,2,1] => 3
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [3,2,1] => 3
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [3,2,1] => 3
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [3,2,1] => 3
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [3,1,2] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [4,3,2,1] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [4,3,2,1] => 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [4,3,2,1] => 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [4,3,2,1] => 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [4,3,1,2] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [4,3,2,1] => 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [4,3,2,1] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [4,3,2,1] => 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [4,3,2,1] => 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [4,3,1,2] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [4,2,3,1] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [4,2,1,3] => 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => [4,1,3,2] => 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [4,1,3,2] => 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [5,4,3,1,2] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [5,4,3,1,2] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [5,4,2,3,1] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [5,4,2,1,3] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => [5,4,1,3,2] => 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [5,4,1,3,2] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [5,4,3,1,2] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [5,4,3,1,2] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [5,4,2,3,1] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [5,4,2,1,3] => 3
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => [5,4,1,3,2] => 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [5,4,1,3,2] => 4
Description
The number of saliances of the permutation.
A saliance is a right-to-left maximum. This can be described as an occurrence of the mesh pattern $([1], {(1,1)})$, i.e., the upper right quadrant is shaded, see [1].
Matching statistic: St000203
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
St000203: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
St000203: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [.,.]
=> 1
[1,0,1,0]
=> [1,2] => [1,2] => [.,[.,.]]
=> 2
[1,1,0,0]
=> [2,1] => [1,2] => [.,[.,.]]
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [.,[.,[.,.]]]
=> 3
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [.,[.,[.,.]]]
=> 3
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [.,[.,[.,.]]]
=> 3
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [.,[.,[.,.]]]
=> 3
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [.,[[.,.],.]]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [.,[.,[[.,.],.]]]
=> 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [.,[.,[[.,.],.]]]
=> 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [.,[[.,.],[.,.]]]
=> 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [.,[[.,[.,.]],.]]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => [.,[[.,.],[.,.]]]
=> 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [.,[[.,.],[.,.]]]
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> 4
Description
The number of external nodes of a binary tree.
That is, the number of nodes that can be reached from the root by only left steps or only right steps, plus $1$ for the root node itself. A counting formula for the number of external node in all binary trees of size $n$ can be found in [1].
Matching statistic: St000314
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00066: Permutations —inverse⟶ Permutations
St000314: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00066: Permutations —inverse⟶ Permutations
St000314: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 1
[1,0,1,0]
=> [1,2] => [1,2] => [1,2] => 2
[1,1,0,0]
=> [2,1] => [1,2] => [1,2] => 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,2,3] => 3
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [1,2,3] => 3
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [1,2,3] => 3
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [1,2,3] => 3
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [1,3,2] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [1,2,3,4] => 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [1,2,3,4] => 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [1,2,3,4] => 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [1,2,4,3] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [1,2,3,4] => 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [1,2,3,4] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [1,2,3,4] => 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [1,2,3,4] => 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [1,2,4,3] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [1,3,2,4] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [1,4,2,3] => 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => [1,3,4,2] => 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [1,3,4,2] => 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] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [1,2,3,5,4] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [1,2,3,5,4] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [1,2,4,3,5] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [1,2,5,3,4] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => [1,2,4,5,3] => 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [1,2,4,5,3] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [1,2,3,5,4] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [1,2,3,5,4] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [1,2,4,3,5] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [1,2,5,3,4] => 3
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => [1,2,4,5,3] => 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [1,2,4,5,3] => 4
Description
The number of left-to-right-maxima of a permutation.
An integer $\sigma_i$ in the one-line notation of a permutation $\sigma$ is a '''left-to-right-maximum''' if there does not exist a $j < i$ such that $\sigma_j > \sigma_i$.
This is also the number of weak exceedences of a permutation that are not mid-points of a decreasing subsequence of length 3, see [1] for more on the later description.
Matching statistic: St000542
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
St000542: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
St000542: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 1
[1,0,1,0]
=> [1,2] => [1,2] => [2,1] => 2
[1,1,0,0]
=> [2,1] => [1,2] => [2,1] => 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [3,2,1] => 3
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [3,2,1] => 3
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [3,2,1] => 3
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [3,2,1] => 3
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [2,3,1] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [4,3,2,1] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [4,3,2,1] => 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [4,3,2,1] => 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [4,3,2,1] => 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [3,4,2,1] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [4,3,2,1] => 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [4,3,2,1] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [4,3,2,1] => 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [4,3,2,1] => 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [3,4,2,1] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [4,2,3,1] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [2,4,3,1] => 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => [3,2,4,1] => 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [3,2,4,1] => 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [4,5,3,2,1] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [4,5,3,2,1] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [5,3,4,2,1] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [3,5,4,2,1] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => [4,3,5,2,1] => 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [4,3,5,2,1] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [4,5,3,2,1] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [4,5,3,2,1] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [5,3,4,2,1] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [3,5,4,2,1] => 3
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => [4,3,5,2,1] => 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [4,3,5,2,1] => 4
Description
The number of left-to-right-minima of a permutation.
An integer $\sigma_i$ in the one-line notation of a permutation $\sigma$ is a left-to-right-minimum if there does not exist a j < i such that $\sigma_j < \sigma_i$.
Matching statistic: St001004
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00089: Permutations —Inverse Kreweras complement⟶ Permutations
St001004: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00089: Permutations —Inverse Kreweras complement⟶ Permutations
St001004: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 1
[1,0,1,0]
=> [1,2] => [1,2] => [2,1] => 2
[1,1,0,0]
=> [2,1] => [1,2] => [2,1] => 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [2,3,1] => 3
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [2,3,1] => 3
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [2,3,1] => 3
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [2,3,1] => 3
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [3,2,1] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [2,3,4,1] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [2,3,4,1] => 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [2,3,4,1] => 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [2,3,4,1] => 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [2,4,3,1] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [2,3,4,1] => 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [2,3,4,1] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [2,3,4,1] => 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [2,3,4,1] => 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [2,4,3,1] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [3,2,4,1] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [4,2,3,1] => 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => [3,4,2,1] => 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [3,4,2,1] => 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [2,3,5,4,1] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [2,3,5,4,1] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [2,4,3,5,1] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [2,5,3,4,1] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => [2,4,5,3,1] => 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [2,4,5,3,1] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [2,3,5,4,1] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [2,3,5,4,1] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [2,4,3,5,1] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [2,5,3,4,1] => 3
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => [2,4,5,3,1] => 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [2,4,5,3,1] => 4
Description
The number of indices that are either left-to-right maxima or right-to-left minima.
The (bivariate) generating function for this statistic is (essentially) given in [1], the mid points of a $321$ pattern in the permutation are those elements which are neither left-to-right maxima nor a right-to-left minima, see [[St000371]] and [[St000372]].
Matching statistic: St000996
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00089: Permutations —Inverse Kreweras complement⟶ Permutations
St000996: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00089: Permutations —Inverse Kreweras complement⟶ Permutations
St000996: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 0 = 1 - 1
[1,0,1,0]
=> [1,2] => [1,2] => [2,1] => 1 = 2 - 1
[1,1,0,0]
=> [2,1] => [1,2] => [2,1] => 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [2,3,1] => 2 = 3 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [2,3,1] => 2 = 3 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [2,3,1] => 2 = 3 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [2,3,1] => 2 = 3 - 1
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [3,2,1] => 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [2,3,4,1] => 3 = 4 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [2,3,4,1] => 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [2,3,4,1] => 3 = 4 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [2,3,4,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [2,4,3,1] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [2,3,4,1] => 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [2,3,4,1] => 3 = 4 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [2,3,4,1] => 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [2,3,4,1] => 3 = 4 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [2,4,3,1] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [3,2,4,1] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [4,2,3,1] => 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => [3,4,2,1] => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [3,4,2,1] => 2 = 3 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [2,3,5,4,1] => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [2,3,5,4,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [2,4,3,5,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [2,5,3,4,1] => 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => [2,4,5,3,1] => 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [2,4,5,3,1] => 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [2,3,5,4,1] => 3 = 4 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [2,3,4,5,1] => 4 = 5 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [2,3,5,4,1] => 3 = 4 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [2,4,3,5,1] => 3 = 4 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [2,5,3,4,1] => 2 = 3 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => [2,4,5,3,1] => 3 = 4 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [2,4,5,3,1] => 3 = 4 - 1
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.
Matching statistic: St001179
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001179: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001179: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 6 = 5 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 6 = 5 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 6 = 5 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 6 = 5 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 6 = 5 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 5 = 4 + 1
Description
Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra.
Matching statistic: St001005
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00089: Permutations —Inverse Kreweras complement⟶ Permutations
St001005: Permutations ⟶ ℤResult quality: 83% ●values known / values provided: 99%●distinct values known / distinct values provided: 83%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00089: Permutations —Inverse Kreweras complement⟶ Permutations
St001005: Permutations ⟶ ℤResult quality: 83% ●values known / values provided: 99%●distinct values known / distinct values provided: 83%
Values
[1,0]
=> [1] => [1] => [1] => ? = 1
[1,0,1,0]
=> [1,2] => [1,2] => [2,1] => 2
[1,1,0,0]
=> [2,1] => [1,2] => [2,1] => 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [2,3,1] => 3
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [2,3,1] => 3
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [2,3,1] => 3
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [2,3,1] => 3
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [3,2,1] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [2,3,4,1] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [2,3,4,1] => 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [2,3,4,1] => 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [2,3,4,1] => 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [2,4,3,1] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [2,3,4,1] => 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [2,3,4,1] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [2,3,4,1] => 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [2,3,4,1] => 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [2,4,3,1] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [3,2,4,1] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [4,2,3,1] => 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => [3,4,2,1] => 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [3,4,2,1] => 3
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [2,3,5,4,1] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [2,3,5,4,1] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [2,4,3,5,1] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [2,5,3,4,1] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => [2,4,5,3,1] => 4
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [2,4,5,3,1] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [2,3,5,4,1] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [2,3,4,5,1] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [2,3,5,4,1] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [2,4,3,5,1] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [2,5,3,4,1] => 3
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => [2,4,5,3,1] => 4
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [2,4,5,3,1] => 4
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [1,3,2,4,5] => [3,2,4,5,1] => 4
Description
The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both.
Matching statistic: St000541
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
St000541: Permutations ⟶ ℤResult quality: 83% ●values known / values provided: 99%●distinct values known / distinct values provided: 83%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
St000541: Permutations ⟶ ℤResult quality: 83% ●values known / values provided: 99%●distinct values known / distinct values provided: 83%
Values
[1,0]
=> [1] => [1] => [1] => ? = 1 - 1
[1,0,1,0]
=> [1,2] => [1,2] => [2,1] => 1 = 2 - 1
[1,1,0,0]
=> [2,1] => [1,2] => [2,1] => 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [3,2,1] => 2 = 3 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [3,2,1] => 2 = 3 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [3,2,1] => 2 = 3 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [3,2,1] => 2 = 3 - 1
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [2,3,1] => 1 = 2 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [4,3,2,1] => 3 = 4 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [4,3,2,1] => 3 = 4 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [4,3,2,1] => 3 = 4 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [4,3,2,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [3,4,2,1] => 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [4,3,2,1] => 3 = 4 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [4,3,2,1] => 3 = 4 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [4,3,2,1] => 3 = 4 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [4,3,2,1] => 3 = 4 - 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [3,4,2,1] => 2 = 3 - 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [4,2,3,1] => 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [2,4,3,1] => 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => [3,2,4,1] => 2 = 3 - 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [3,2,4,1] => 2 = 3 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [4,5,3,2,1] => 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [4,5,3,2,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [5,3,4,2,1] => 3 = 4 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [3,5,4,2,1] => 2 = 3 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => [4,3,5,2,1] => 3 = 4 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [4,3,5,2,1] => 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [4,5,3,2,1] => 3 = 4 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [5,4,3,2,1] => 4 = 5 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [4,5,3,2,1] => 3 = 4 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [5,3,4,2,1] => 3 = 4 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [3,5,4,2,1] => 2 = 3 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => [4,3,5,2,1] => 3 = 4 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [4,3,5,2,1] => 3 = 4 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [1,3,2,4,5] => [5,4,2,3,1] => 3 = 4 - 1
Description
The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right.
For a permutation $\pi$ of length $n$, this is the number of indices $2 \leq j \leq n$ such that for all $1 \leq i < j$, the pair $(i,j)$ is an inversion of $\pi$.
The following 6 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St000717The number of ordinal summands of a poset. St001875The number of simple modules with projective dimension at most 1.
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!