searching the database
Your data matches 62 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: St000996
(load all 15 compositions to match this statistic)
(load all 15 compositions to match this statistic)
St000996: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => 0
[1,2] => 0
[2,1] => 1
[1,2,3] => 0
[1,3,2] => 1
[2,1,3] => 1
[2,3,1] => 2
[3,1,2] => 1
[3,2,1] => 1
[1,2,3,4] => 0
[1,2,4,3] => 1
[1,3,2,4] => 1
[1,3,4,2] => 2
[1,4,2,3] => 1
[1,4,3,2] => 1
[2,1,3,4] => 1
[2,1,4,3] => 2
[2,3,1,4] => 2
[2,3,4,1] => 3
[2,4,1,3] => 2
[2,4,3,1] => 2
[3,1,2,4] => 1
[3,1,4,2] => 2
[3,2,1,4] => 1
[3,2,4,1] => 2
[3,4,1,2] => 2
[3,4,2,1] => 2
[4,1,2,3] => 1
[4,1,3,2] => 1
[4,2,1,3] => 1
[4,2,3,1] => 1
[4,3,1,2] => 1
[4,3,2,1] => 1
[1,2,3,4,5] => 0
[1,2,3,5,4] => 1
[1,2,4,3,5] => 1
[1,2,4,5,3] => 2
[1,2,5,3,4] => 1
[1,2,5,4,3] => 1
[1,3,2,4,5] => 1
[1,3,2,5,4] => 2
[1,3,4,2,5] => 2
[1,3,4,5,2] => 3
[1,3,5,2,4] => 2
[1,3,5,4,2] => 2
[1,4,2,3,5] => 1
[1,4,2,5,3] => 2
[1,4,3,2,5] => 1
[1,4,3,5,2] => 2
[1,4,5,2,3] => 2
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: St000374
(load all 18 compositions to match this statistic)
(load all 18 compositions to match this statistic)
Mp00066: Permutations —inverse⟶ Permutations
St000374: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000374: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => 0
[1,2] => [1,2] => 0
[2,1] => [2,1] => 1
[1,2,3] => [1,2,3] => 0
[1,3,2] => [1,3,2] => 1
[2,1,3] => [2,1,3] => 1
[2,3,1] => [3,1,2] => 2
[3,1,2] => [2,3,1] => 1
[3,2,1] => [3,2,1] => 1
[1,2,3,4] => [1,2,3,4] => 0
[1,2,4,3] => [1,2,4,3] => 1
[1,3,2,4] => [1,3,2,4] => 1
[1,3,4,2] => [1,4,2,3] => 2
[1,4,2,3] => [1,3,4,2] => 1
[1,4,3,2] => [1,4,3,2] => 1
[2,1,3,4] => [2,1,3,4] => 1
[2,1,4,3] => [2,1,4,3] => 2
[2,3,1,4] => [3,1,2,4] => 2
[2,3,4,1] => [4,1,2,3] => 3
[2,4,1,3] => [3,1,4,2] => 2
[2,4,3,1] => [4,1,3,2] => 2
[3,1,2,4] => [2,3,1,4] => 1
[3,1,4,2] => [2,4,1,3] => 2
[3,2,1,4] => [3,2,1,4] => 1
[3,2,4,1] => [4,2,1,3] => 2
[3,4,1,2] => [3,4,1,2] => 2
[3,4,2,1] => [4,3,1,2] => 2
[4,1,2,3] => [2,3,4,1] => 1
[4,1,3,2] => [2,4,3,1] => 1
[4,2,1,3] => [3,2,4,1] => 1
[4,2,3,1] => [4,2,3,1] => 1
[4,3,1,2] => [3,4,2,1] => 1
[4,3,2,1] => [4,3,2,1] => 1
[1,2,3,4,5] => [1,2,3,4,5] => 0
[1,2,3,5,4] => [1,2,3,5,4] => 1
[1,2,4,3,5] => [1,2,4,3,5] => 1
[1,2,4,5,3] => [1,2,5,3,4] => 2
[1,2,5,3,4] => [1,2,4,5,3] => 1
[1,2,5,4,3] => [1,2,5,4,3] => 1
[1,3,2,4,5] => [1,3,2,4,5] => 1
[1,3,2,5,4] => [1,3,2,5,4] => 2
[1,3,4,2,5] => [1,4,2,3,5] => 2
[1,3,4,5,2] => [1,5,2,3,4] => 3
[1,3,5,2,4] => [1,4,2,5,3] => 2
[1,3,5,4,2] => [1,5,2,4,3] => 2
[1,4,2,3,5] => [1,3,4,2,5] => 1
[1,4,2,5,3] => [1,3,5,2,4] => 2
[1,4,3,2,5] => [1,4,3,2,5] => 1
[1,4,3,5,2] => [1,5,3,2,4] => 2
[1,4,5,2,3] => [1,4,5,2,3] => 2
Description
The number of exclusive right-to-left minima of a permutation.
This is the number of right-to-left minima that are not left-to-right maxima.
This is also the number of non weak exceedences of a permutation that are also not mid-points of a decreasing subsequence of length 3.
Given a permutation $\pi = [\pi_1,\ldots,\pi_n]$, this statistic counts the number of position $j$ such that $\pi_j < j$ and there do not exist indices $i,k$ with $i < j < k$ and $\pi_i > \pi_j > \pi_k$.
See also [[St000213]] and [[St000119]].
Matching statistic: St000053
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000053: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000053: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,0]
=> 0
[1,2] => [1,0,1,0]
=> [1,1,0,0]
=> 0
[2,1] => [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,2,3] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[2,1,3] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[2,3,1] => [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
[3,1,2] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 1
[3,2,1] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 1
[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,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[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,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
Description
The number of valleys of the Dyck path.
Matching statistic: St001169
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001169: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001169: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,0]
=> 0
[1,2] => [1,0,1,0]
=> [1,1,0,0]
=> 0
[2,1] => [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,2,3] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[2,1,3] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[2,3,1] => [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
[3,1,2] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 1
[3,2,1] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 1
[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,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[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,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
Description
Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St001215
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001215: 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
St001215: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,0]
=> 0
[1,2] => [1,0,1,0]
=> [1,1,0,0]
=> 0
[2,1] => [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,2,3] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[2,1,3] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[2,3,1] => [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 2
[3,1,2] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1
[3,2,1] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1
[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,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[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,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
Description
Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. Then the statistic gives the vector space dimension of the second Ext-group between X and the regular module.
For the first 196 values, the statistic also gives the number of indecomposable non-projective modules $X$ such that $\tau(X)$ has codominant dimension equal to one and projective dimension equal to one.
Matching statistic: St000015
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000015: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000015: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,0]
=> 1 = 0 + 1
[1,2] => [1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[2,1] => [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,2,3] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[2,1,3] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[2,3,1] => [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[3,1,2] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2 = 1 + 1
[3,2,1] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2 = 1 + 1
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[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]
=> 1 = 0 + 1
[1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 1 + 1
[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 1 + 1
[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3 = 2 + 1
Description
The number of peaks of a Dyck path.
Matching statistic: St001068
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001068: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001068: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,0]
=> 1 = 0 + 1
[1,2] => [1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[2,1] => [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,2,3] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[2,1,3] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[2,3,1] => [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[3,1,2] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2 = 1 + 1
[3,2,1] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2 = 1 + 1
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[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]
=> 1 = 0 + 1
[1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 1 + 1
[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 1 + 1
[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3 = 2 + 1
Description
Number of torsionless simple modules in the corresponding Nakayama algebra.
Matching statistic: St000021
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00069: Permutations —complement⟶ Permutations
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
Mp00149: Permutations —Lehmer code rotation⟶ Permutations
St000021: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
Mp00149: Permutations —Lehmer code rotation⟶ Permutations
St000021: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1] => [1] => 0
[1,2] => [2,1] => [2,1] => [1,2] => 0
[2,1] => [1,2] => [1,2] => [2,1] => 1
[1,2,3] => [3,2,1] => [3,2,1] => [1,2,3] => 0
[1,3,2] => [3,1,2] => [3,1,2] => [1,3,2] => 1
[2,1,3] => [2,3,1] => [2,3,1] => [3,1,2] => 1
[2,3,1] => [2,1,3] => [2,1,3] => [3,2,1] => 2
[3,1,2] => [1,3,2] => [1,3,2] => [2,1,3] => 1
[3,2,1] => [1,2,3] => [1,3,2] => [2,1,3] => 1
[1,2,3,4] => [4,3,2,1] => [4,3,2,1] => [1,2,3,4] => 0
[1,2,4,3] => [4,3,1,2] => [4,3,1,2] => [1,2,4,3] => 1
[1,3,2,4] => [4,2,3,1] => [4,2,3,1] => [1,4,2,3] => 1
[1,3,4,2] => [4,2,1,3] => [4,2,1,3] => [1,4,3,2] => 2
[1,4,2,3] => [4,1,3,2] => [4,1,3,2] => [1,3,2,4] => 1
[1,4,3,2] => [4,1,2,3] => [4,1,3,2] => [1,3,2,4] => 1
[2,1,3,4] => [3,4,2,1] => [3,4,2,1] => [4,1,2,3] => 1
[2,1,4,3] => [3,4,1,2] => [3,4,1,2] => [4,1,3,2] => 2
[2,3,1,4] => [3,2,4,1] => [3,2,4,1] => [4,3,1,2] => 2
[2,3,4,1] => [3,2,1,4] => [3,2,1,4] => [4,3,2,1] => 3
[2,4,1,3] => [3,1,4,2] => [3,1,4,2] => [4,2,1,3] => 2
[2,4,3,1] => [3,1,2,4] => [3,1,4,2] => [4,2,1,3] => 2
[3,1,2,4] => [2,4,3,1] => [2,4,3,1] => [3,1,2,4] => 1
[3,1,4,2] => [2,4,1,3] => [2,4,1,3] => [3,1,4,2] => 2
[3,2,1,4] => [2,3,4,1] => [2,4,3,1] => [3,1,2,4] => 1
[3,2,4,1] => [2,3,1,4] => [2,4,1,3] => [3,1,4,2] => 2
[3,4,1,2] => [2,1,4,3] => [2,1,4,3] => [3,2,1,4] => 2
[3,4,2,1] => [2,1,3,4] => [2,1,4,3] => [3,2,1,4] => 2
[4,1,2,3] => [1,4,3,2] => [1,4,3,2] => [2,1,3,4] => 1
[4,1,3,2] => [1,4,2,3] => [1,4,3,2] => [2,1,3,4] => 1
[4,2,1,3] => [1,3,4,2] => [1,4,3,2] => [2,1,3,4] => 1
[4,2,3,1] => [1,3,2,4] => [1,4,3,2] => [2,1,3,4] => 1
[4,3,1,2] => [1,2,4,3] => [1,4,3,2] => [2,1,3,4] => 1
[4,3,2,1] => [1,2,3,4] => [1,4,3,2] => [2,1,3,4] => 1
[1,2,3,4,5] => [5,4,3,2,1] => [5,4,3,2,1] => [1,2,3,4,5] => 0
[1,2,3,5,4] => [5,4,3,1,2] => [5,4,3,1,2] => [1,2,3,5,4] => 1
[1,2,4,3,5] => [5,4,2,3,1] => [5,4,2,3,1] => [1,2,5,3,4] => 1
[1,2,4,5,3] => [5,4,2,1,3] => [5,4,2,1,3] => [1,2,5,4,3] => 2
[1,2,5,3,4] => [5,4,1,3,2] => [5,4,1,3,2] => [1,2,4,3,5] => 1
[1,2,5,4,3] => [5,4,1,2,3] => [5,4,1,3,2] => [1,2,4,3,5] => 1
[1,3,2,4,5] => [5,3,4,2,1] => [5,3,4,2,1] => [1,5,2,3,4] => 1
[1,3,2,5,4] => [5,3,4,1,2] => [5,3,4,1,2] => [1,5,2,4,3] => 2
[1,3,4,2,5] => [5,3,2,4,1] => [5,3,2,4,1] => [1,5,4,2,3] => 2
[1,3,4,5,2] => [5,3,2,1,4] => [5,3,2,1,4] => [1,5,4,3,2] => 3
[1,3,5,2,4] => [5,3,1,4,2] => [5,3,1,4,2] => [1,5,3,2,4] => 2
[1,3,5,4,2] => [5,3,1,2,4] => [5,3,1,4,2] => [1,5,3,2,4] => 2
[1,4,2,3,5] => [5,2,4,3,1] => [5,2,4,3,1] => [1,4,2,3,5] => 1
[1,4,2,5,3] => [5,2,4,1,3] => [5,2,4,1,3] => [1,4,2,5,3] => 2
[1,4,3,2,5] => [5,2,3,4,1] => [5,2,4,3,1] => [1,4,2,3,5] => 1
[1,4,3,5,2] => [5,2,3,1,4] => [5,2,4,1,3] => [1,4,2,5,3] => 2
[1,4,5,2,3] => [5,2,1,4,3] => [5,2,1,4,3] => [1,4,3,2,5] => 2
Description
The number of descents of a permutation.
This can be described as an occurrence of the vincular mesh pattern ([2,1], {(1,0),(1,1),(1,2)}), i.e., the middle column is shaded, see [3].
Matching statistic: St000024
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,0]
=> [1,0]
=> 0
[1,2] => [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
[2,1] => [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,2,3] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 1
[2,1,3] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
[2,3,1] => [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 2
[3,1,2] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[3,2,1] => [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,2,4,3] => [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,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2
[2,3,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]
=> 3
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[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]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1
[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2
[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 3
[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2
[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2
[1,4,2,3,5] => [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,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,4,3,2,5] => [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,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
Description
The number of double up and double down steps of a Dyck path.
In other words, this is the number of double rises (and, equivalently, the number of double falls) of a Dyck path.
Matching statistic: St000052
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
[1,2] => [1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
[2,1] => [1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 1
[1,2,3] => [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[2,1,3] => [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[2,3,1] => [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[3,1,2] => [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[3,2,1] => [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 1
[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 2
[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 1
[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 1
[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 1
[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 2
[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 2
[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 3
[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 2
[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 2
[1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 1
[1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 2
[1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 1
[1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 2
[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 2
Description
The number of valleys of a Dyck path not on the x-axis.
That is, the number of valleys of nonminimal height. This corresponds to the number of -1's in an inclusion of Dyck paths into alternating sign matrices.
The following 52 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000120The number of left tunnels of a Dyck path. St000155The number of exceedances (also excedences) of a permutation. St000245The number of ascents of a permutation. St000292The number of ascents of a binary word. St000316The number of non-left-to-right-maxima of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000340The number of non-final maximal constant sub-paths of length greater than one. St000662The staircase size of the code of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000703The number of deficiencies of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St000062The length of the longest increasing subsequence of the permutation. St000105The number of blocks in the set partition. St000157The number of descents of a standard tableau. St000164The number of short pairs. St000167The number of leaves of an ordered tree. St000213The number of weak exceedances (also weak excedences) of a permutation. St000239The number of small weak excedances. St000291The number of descents of a binary word. St000314The number of left-to-right-maxima of a permutation. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000325The width of the tree associated to a permutation. St000390The number of runs of ones in a binary word. St000443The number of long tunnels of a Dyck path. St000470The number of runs in a permutation. St000542The number of left-to-right-minima of a permutation. St000740The last entry of a permutation. St000912The number of maximal antichains in a poset. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St000083The number of left oriented leafs of a binary tree except the first one. St000354The number of recoils of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000829The Ulam distance of a permutation to the identity permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000925The number of topologically connected components of a set partition. St001346The number of parking functions that give the same permutation. St000159The number of distinct parts of the integer partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000647The number of big descents of a permutation. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000702The number of weak deficiencies of a permutation. St000991The number of right-to-left minima of a permutation. St001330The hat guessing number of a graph. St001712The number of natural descents of a standard Young tableau. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$.
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!