searching the database
Your data matches 44 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: St000740
(load all 194 compositions to match this statistic)
(load all 194 compositions to match this statistic)
St000740: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => 1
[1,2] => 2
[2,1] => 1
[1,2,3] => 3
[1,3,2] => 2
[2,1,3] => 3
[2,3,1] => 1
[3,1,2] => 2
[3,2,1] => 1
[1,2,3,4] => 4
[1,2,4,3] => 3
[1,3,2,4] => 4
[1,3,4,2] => 2
[1,4,2,3] => 3
[1,4,3,2] => 2
[2,1,3,4] => 4
[2,1,4,3] => 3
[2,3,1,4] => 4
[2,3,4,1] => 1
[2,4,1,3] => 3
[2,4,3,1] => 1
[3,1,2,4] => 4
[3,1,4,2] => 2
[3,2,1,4] => 4
[3,2,4,1] => 1
[3,4,1,2] => 2
[3,4,2,1] => 1
[4,1,2,3] => 3
[4,1,3,2] => 2
[4,2,1,3] => 3
[4,2,3,1] => 1
[4,3,1,2] => 2
[4,3,2,1] => 1
[1,2,3,4,5] => 5
[1,2,3,5,4] => 4
[1,2,4,3,5] => 5
[1,2,4,5,3] => 3
[1,2,5,3,4] => 4
[1,2,5,4,3] => 3
[1,3,2,4,5] => 5
[1,3,2,5,4] => 4
[1,3,4,2,5] => 5
[1,3,4,5,2] => 2
[1,3,5,2,4] => 4
[1,3,5,4,2] => 2
[1,4,2,3,5] => 5
[1,4,2,5,3] => 3
[1,4,3,2,5] => 5
[1,4,3,5,2] => 2
[1,4,5,2,3] => 3
Description
The last entry of a permutation.
This statistic is undefined for the empty permutation.
Matching statistic: St000025
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00064: Permutations —reverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> 1
[1,2] => [2,1] => [1,1,0,0]
=> 2
[2,1] => [1,2] => [1,0,1,0]
=> 1
[1,2,3] => [3,2,1] => [1,1,1,0,0,0]
=> 3
[1,3,2] => [2,3,1] => [1,1,0,1,0,0]
=> 2
[2,1,3] => [3,1,2] => [1,1,1,0,0,0]
=> 3
[2,3,1] => [1,3,2] => [1,0,1,1,0,0]
=> 1
[3,1,2] => [2,1,3] => [1,1,0,0,1,0]
=> 2
[3,2,1] => [1,2,3] => [1,0,1,0,1,0]
=> 1
[1,2,3,4] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 4
[1,2,4,3] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> 3
[1,3,2,4] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 4
[1,3,4,2] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> 2
[1,4,2,3] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> 3
[1,4,3,2] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 2
[2,1,3,4] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> 4
[2,1,4,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 3
[2,3,1,4] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> 4
[2,3,4,1] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 1
[2,4,1,3] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 3
[2,4,3,1] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 1
[3,1,2,4] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> 4
[3,1,4,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 2
[3,2,1,4] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 4
[3,2,4,1] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 1
[3,4,1,2] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 2
[3,4,2,1] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 1
[4,1,2,3] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 3
[4,1,3,2] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 2
[4,2,1,3] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 3
[4,2,3,1] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 1
[4,3,1,2] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 2
[4,3,2,1] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 1
[1,2,3,4,5] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,2,3,5,4] => [4,5,3,2,1] => [1,1,1,1,0,1,0,0,0,0]
=> 4
[1,2,4,3,5] => [5,3,4,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,2,4,5,3] => [3,5,4,2,1] => [1,1,1,0,1,1,0,0,0,0]
=> 3
[1,2,5,3,4] => [4,3,5,2,1] => [1,1,1,1,0,0,1,0,0,0]
=> 4
[1,2,5,4,3] => [3,4,5,2,1] => [1,1,1,0,1,0,1,0,0,0]
=> 3
[1,3,2,4,5] => [5,4,2,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,3,2,5,4] => [4,5,2,3,1] => [1,1,1,1,0,1,0,0,0,0]
=> 4
[1,3,4,2,5] => [5,2,4,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,3,4,5,2] => [2,5,4,3,1] => [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,3,5,2,4] => [4,2,5,3,1] => [1,1,1,1,0,0,1,0,0,0]
=> 4
[1,3,5,4,2] => [2,4,5,3,1] => [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,4,2,3,5] => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,4,2,5,3] => [3,5,2,4,1] => [1,1,1,0,1,1,0,0,0,0]
=> 3
[1,4,3,2,5] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,4,3,5,2] => [2,5,3,4,1] => [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,4,5,2,3] => [3,2,5,4,1] => [1,1,1,0,0,1,1,0,0,0]
=> 3
Description
The number of initial rises of a Dyck path.
In other words, this is the height of the first peak of $D$.
Matching statistic: St000439
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00064: Permutations —reverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000439: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000439: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> 2 = 1 + 1
[1,2] => [2,1] => [1,1,0,0]
=> 3 = 2 + 1
[2,1] => [1,2] => [1,0,1,0]
=> 2 = 1 + 1
[1,2,3] => [3,2,1] => [1,1,1,0,0,0]
=> 4 = 3 + 1
[1,3,2] => [2,3,1] => [1,1,0,1,0,0]
=> 3 = 2 + 1
[2,1,3] => [3,1,2] => [1,1,1,0,0,0]
=> 4 = 3 + 1
[2,3,1] => [1,3,2] => [1,0,1,1,0,0]
=> 2 = 1 + 1
[3,1,2] => [2,1,3] => [1,1,0,0,1,0]
=> 3 = 2 + 1
[3,2,1] => [1,2,3] => [1,0,1,0,1,0]
=> 2 = 1 + 1
[1,2,3,4] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,2,4,3] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,3,2,4] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,3,4,2] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,4,2,3] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,4,3,2] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[2,1,3,4] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[2,1,4,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[2,3,1,4] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[2,3,4,1] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[2,4,1,3] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[2,4,3,1] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[3,1,2,4] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[3,1,4,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[3,2,1,4] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[3,2,4,1] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[3,4,1,2] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[3,4,2,1] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[4,1,2,3] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[4,1,3,2] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[4,2,1,3] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[4,2,3,1] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[4,3,1,2] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[4,3,2,1] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,2,3,4,5] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,2,3,5,4] => [4,5,3,2,1] => [1,1,1,1,0,1,0,0,0,0]
=> 5 = 4 + 1
[1,2,4,3,5] => [5,3,4,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,2,4,5,3] => [3,5,4,2,1] => [1,1,1,0,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,2,5,3,4] => [4,3,5,2,1] => [1,1,1,1,0,0,1,0,0,0]
=> 5 = 4 + 1
[1,2,5,4,3] => [3,4,5,2,1] => [1,1,1,0,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,3,2,4,5] => [5,4,2,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,3,2,5,4] => [4,5,2,3,1] => [1,1,1,1,0,1,0,0,0,0]
=> 5 = 4 + 1
[1,3,4,2,5] => [5,2,4,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,3,4,5,2] => [2,5,4,3,1] => [1,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,3,5,2,4] => [4,2,5,3,1] => [1,1,1,1,0,0,1,0,0,0]
=> 5 = 4 + 1
[1,3,5,4,2] => [2,4,5,3,1] => [1,1,0,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,4,2,3,5] => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,4,2,5,3] => [3,5,2,4,1] => [1,1,1,0,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,4,3,5,2] => [2,5,3,4,1] => [1,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,4,5,2,3] => [3,2,5,4,1] => [1,1,1,0,0,1,1,0,0,0]
=> 4 = 3 + 1
Description
The position of the first down step of a Dyck path.
Matching statistic: St000011
Mp00064: Permutations —reverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> [1,0]
=> 1
[1,2] => [2,1] => [1,1,0,0]
=> [1,0,1,0]
=> 2
[2,1] => [1,2] => [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,2,3] => [3,2,1] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 3
[1,3,2] => [2,3,1] => [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 2
[2,1,3] => [3,1,2] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 3
[2,3,1] => [1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
[3,1,2] => [2,1,3] => [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
[3,2,1] => [1,2,3] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
[1,2,3,4] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,2,4,3] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,3,2,4] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,3,4,2] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,4,2,3] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,4,3,2] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[2,1,3,4] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[2,1,4,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 3
[2,3,1,4] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[2,3,4,1] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[2,4,1,3] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[2,4,3,1] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[3,1,2,4] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[3,1,4,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[3,2,1,4] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[3,2,4,1] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[3,4,1,2] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[3,4,2,1] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,1,2,3] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 3
[4,1,3,2] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,2,1,3] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 3
[4,2,3,1] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[4,3,1,2] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[4,3,2,1] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,2,3,4,5] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,2,3,5,4] => [4,5,3,2,1] => [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,2,4,3,5] => [5,3,4,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,2,4,5,3] => [3,5,4,2,1] => [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,2,5,3,4] => [4,3,5,2,1] => [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4
[1,2,5,4,3] => [3,4,5,2,1] => [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,3,2,4,5] => [5,4,2,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,3,2,5,4] => [4,5,2,3,1] => [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,3,4,2,5] => [5,2,4,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,3,4,5,2] => [2,5,4,3,1] => [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,3,5,2,4] => [4,2,5,3,1] => [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4
[1,3,5,4,2] => [2,4,5,3,1] => [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,4,2,3,5] => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,4,2,5,3] => [3,5,2,4,1] => [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,4,3,2,5] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,4,3,5,2] => [2,5,3,4,1] => [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,4,5,2,3] => [3,2,5,4,1] => [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3
Description
The number of touch points (or returns) of a Dyck path.
This is the number of points, excluding the origin, where the Dyck path has height 0.
Matching statistic: St000026
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00088: Permutations —Kreweras complement⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [.,.]
=> [1,0]
=> 1
[1,2] => [2,1] => [[.,.],.]
=> [1,1,0,0]
=> 2
[2,1] => [1,2] => [.,[.,.]]
=> [1,0,1,0]
=> 1
[1,2,3] => [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 3
[1,3,2] => [2,1,3] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 2
[2,1,3] => [3,2,1] => [[[.,.],.],.]
=> [1,1,1,0,0,0]
=> 3
[2,3,1] => [1,2,3] => [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> 1
[3,1,2] => [3,1,2] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 2
[3,2,1] => [1,3,2] => [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> 1
[1,2,3,4] => [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> 4
[1,2,4,3] => [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 3
[1,3,2,4] => [2,4,3,1] => [[.,[[.,.],.]],.]
=> [1,1,0,1,1,0,0,0]
=> 4
[1,3,4,2] => [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,4,2,3] => [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 3
[1,4,3,2] => [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[2,1,3,4] => [3,2,4,1] => [[[.,.],[.,.]],.]
=> [1,1,1,0,0,1,0,0]
=> 4
[2,1,4,3] => [3,2,1,4] => [[[.,.],.],[.,.]]
=> [1,1,1,0,0,0,1,0]
=> 3
[2,3,1,4] => [4,2,3,1] => [[[.,.],[.,.]],.]
=> [1,1,1,0,0,1,0,0]
=> 4
[2,3,4,1] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> 1
[2,4,1,3] => [4,2,1,3] => [[[.,.],.],[.,.]]
=> [1,1,1,0,0,0,1,0]
=> 3
[2,4,3,1] => [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,0,1,0,1,1,0,0]
=> 1
[3,1,2,4] => [3,4,2,1] => [[[.,[.,.]],.],.]
=> [1,1,1,0,1,0,0,0]
=> 4
[3,1,4,2] => [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 2
[3,2,1,4] => [4,3,2,1] => [[[[.,.],.],.],.]
=> [1,1,1,1,0,0,0,0]
=> 4
[3,2,4,1] => [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1
[3,4,1,2] => [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 2
[3,4,2,1] => [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1
[4,1,2,3] => [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 3
[4,1,3,2] => [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,2,1,3] => [4,3,1,2] => [[[.,.],.],[.,.]]
=> [1,1,1,0,0,0,1,0]
=> 3
[4,2,3,1] => [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 1
[4,3,1,2] => [4,1,3,2] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,3,2,1] => [1,4,3,2] => [.,[[[.,.],.],.]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,2,3,4,5] => [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,0,1,0,1,0,1,0,0]
=> 5
[1,2,3,5,4] => [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 4
[1,2,4,3,5] => [2,3,5,4,1] => [[.,[.,[[.,.],.]]],.]
=> [1,1,0,1,0,1,1,0,0,0]
=> 5
[1,2,4,5,3] => [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3
[1,2,5,3,4] => [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 4
[1,2,5,4,3] => [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3
[1,3,2,4,5] => [2,4,3,5,1] => [[.,[[.,.],[.,.]]],.]
=> [1,1,0,1,1,0,0,1,0,0]
=> 5
[1,3,2,5,4] => [2,4,3,1,5] => [[.,[[.,.],.]],[.,.]]
=> [1,1,0,1,1,0,0,0,1,0]
=> 4
[1,3,4,2,5] => [2,5,3,4,1] => [[.,[[.,.],[.,.]]],.]
=> [1,1,0,1,1,0,0,1,0,0]
=> 5
[1,3,4,5,2] => [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2
[1,3,5,2,4] => [2,5,3,1,4] => [[.,[[.,.],.]],[.,.]]
=> [1,1,0,1,1,0,0,0,1,0]
=> 4
[1,3,5,4,2] => [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,4,2,3,5] => [2,4,5,3,1] => [[.,[[.,[.,.]],.]],.]
=> [1,1,0,1,1,0,1,0,0,0]
=> 5
[1,4,2,5,3] => [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3
[1,4,3,2,5] => [2,5,4,3,1] => [[.,[[[.,.],.],.]],.]
=> [1,1,0,1,1,1,0,0,0,0]
=> 5
[1,4,3,5,2] => [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,4,5,2,3] => [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3
Description
The position of the first return of a Dyck path.
Matching statistic: St000069
Mp00064: Permutations —reverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St000069: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St000069: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> ([],1)
=> 1
[1,2] => [2,1] => [1,1,0,0]
=> ([],2)
=> 2
[2,1] => [1,2] => [1,0,1,0]
=> ([(0,1)],2)
=> 1
[1,2,3] => [3,2,1] => [1,1,1,0,0,0]
=> ([],3)
=> 3
[1,3,2] => [2,3,1] => [1,1,0,1,0,0]
=> ([(1,2)],3)
=> 2
[2,1,3] => [3,1,2] => [1,1,1,0,0,0]
=> ([],3)
=> 3
[2,3,1] => [1,3,2] => [1,0,1,1,0,0]
=> ([(0,2),(1,2)],3)
=> 1
[3,1,2] => [2,1,3] => [1,1,0,0,1,0]
=> ([(0,1),(0,2)],3)
=> 2
[3,2,1] => [1,2,3] => [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> 1
[1,2,3,4] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> ([],4)
=> 4
[1,2,4,3] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> ([(2,3)],4)
=> 3
[1,3,2,4] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> ([],4)
=> 4
[1,3,4,2] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> ([(1,3),(2,3)],4)
=> 2
[1,4,2,3] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> ([(1,2),(1,3)],4)
=> 3
[1,4,3,2] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> ([(0,3),(1,2),(1,3)],4)
=> 2
[2,1,3,4] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> ([],4)
=> 4
[2,1,4,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> ([(2,3)],4)
=> 3
[2,3,1,4] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> ([],4)
=> 4
[2,3,4,1] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[2,4,1,3] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> ([(1,2),(1,3)],4)
=> 3
[2,4,3,1] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> ([(0,3),(1,2),(2,3)],4)
=> 1
[3,1,2,4] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> ([],4)
=> 4
[3,1,4,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> ([(1,3),(2,3)],4)
=> 2
[3,2,1,4] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> ([],4)
=> 4
[3,2,4,1] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[3,4,1,2] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[3,4,2,1] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> ([(0,3),(1,3),(3,2)],4)
=> 1
[4,1,2,3] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3)],4)
=> 3
[4,1,3,2] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(3,1)],4)
=> 2
[4,2,1,3] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3)],4)
=> 3
[4,2,3,1] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1
[4,3,1,2] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> ([(0,3),(3,1),(3,2)],4)
=> 2
[4,3,2,1] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> 1
[1,2,3,4,5] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> ([],5)
=> 5
[1,2,3,5,4] => [4,5,3,2,1] => [1,1,1,1,0,1,0,0,0,0]
=> ([(3,4)],5)
=> 4
[1,2,4,3,5] => [5,3,4,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> ([],5)
=> 5
[1,2,4,5,3] => [3,5,4,2,1] => [1,1,1,0,1,1,0,0,0,0]
=> ([(2,4),(3,4)],5)
=> 3
[1,2,5,3,4] => [4,3,5,2,1] => [1,1,1,1,0,0,1,0,0,0]
=> ([(2,3),(2,4)],5)
=> 4
[1,2,5,4,3] => [3,4,5,2,1] => [1,1,1,0,1,0,1,0,0,0]
=> ([(1,4),(2,3),(2,4)],5)
=> 3
[1,3,2,4,5] => [5,4,2,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> ([],5)
=> 5
[1,3,2,5,4] => [4,5,2,3,1] => [1,1,1,1,0,1,0,0,0,0]
=> ([(3,4)],5)
=> 4
[1,3,4,2,5] => [5,2,4,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> ([],5)
=> 5
[1,3,4,5,2] => [2,5,4,3,1] => [1,1,0,1,1,1,0,0,0,0]
=> ([(1,4),(2,4),(3,4)],5)
=> 2
[1,3,5,2,4] => [4,2,5,3,1] => [1,1,1,1,0,0,1,0,0,0]
=> ([(2,3),(2,4)],5)
=> 4
[1,3,5,4,2] => [2,4,5,3,1] => [1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,4),(2,3),(2,4)],5)
=> 2
[1,4,2,3,5] => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> ([],5)
=> 5
[1,4,2,5,3] => [3,5,2,4,1] => [1,1,1,0,1,1,0,0,0,0]
=> ([(2,4),(3,4)],5)
=> 3
[1,4,3,2,5] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> ([],5)
=> 5
[1,4,3,5,2] => [2,5,3,4,1] => [1,1,0,1,1,1,0,0,0,0]
=> ([(1,4),(2,4),(3,4)],5)
=> 2
[1,4,5,2,3] => [3,2,5,4,1] => [1,1,1,0,0,1,1,0,0,0]
=> ([(1,3),(1,4),(2,3),(2,4)],5)
=> 3
Description
The number of maximal elements of a poset.
Matching statistic: St000382
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00064: Permutations —reverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00102: Dyck paths —rise composition⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00102: Dyck paths —rise composition⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> [1] => 1
[1,2] => [2,1] => [1,1,0,0]
=> [2] => 2
[2,1] => [1,2] => [1,0,1,0]
=> [1,1] => 1
[1,2,3] => [3,2,1] => [1,1,1,0,0,0]
=> [3] => 3
[1,3,2] => [2,3,1] => [1,1,0,1,0,0]
=> [2,1] => 2
[2,1,3] => [3,1,2] => [1,1,1,0,0,0]
=> [3] => 3
[2,3,1] => [1,3,2] => [1,0,1,1,0,0]
=> [1,2] => 1
[3,1,2] => [2,1,3] => [1,1,0,0,1,0]
=> [2,1] => 2
[3,2,1] => [1,2,3] => [1,0,1,0,1,0]
=> [1,1,1] => 1
[1,2,3,4] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [4] => 4
[1,2,4,3] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [3,1] => 3
[1,3,2,4] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [4] => 4
[1,3,4,2] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [2,2] => 2
[1,4,2,3] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [3,1] => 3
[1,4,3,2] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [2,1,1] => 2
[2,1,3,4] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [4] => 4
[2,1,4,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [3,1] => 3
[2,3,1,4] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [4] => 4
[2,3,4,1] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,3] => 1
[2,4,1,3] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [3,1] => 3
[2,4,3,1] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,2,1] => 1
[3,1,2,4] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [4] => 4
[3,1,4,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [2,2] => 2
[3,2,1,4] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [4] => 4
[3,2,4,1] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,3] => 1
[3,4,1,2] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [2,2] => 2
[3,4,2,1] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,1,2] => 1
[4,1,2,3] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [3,1] => 3
[4,1,3,2] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [2,1,1] => 2
[4,2,1,3] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [3,1] => 3
[4,2,3,1] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,2,1] => 1
[4,3,1,2] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [2,1,1] => 2
[4,3,2,1] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1
[1,2,3,4,5] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> [5] => 5
[1,2,3,5,4] => [4,5,3,2,1] => [1,1,1,1,0,1,0,0,0,0]
=> [4,1] => 4
[1,2,4,3,5] => [5,3,4,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> [5] => 5
[1,2,4,5,3] => [3,5,4,2,1] => [1,1,1,0,1,1,0,0,0,0]
=> [3,2] => 3
[1,2,5,3,4] => [4,3,5,2,1] => [1,1,1,1,0,0,1,0,0,0]
=> [4,1] => 4
[1,2,5,4,3] => [3,4,5,2,1] => [1,1,1,0,1,0,1,0,0,0]
=> [3,1,1] => 3
[1,3,2,4,5] => [5,4,2,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> [5] => 5
[1,3,2,5,4] => [4,5,2,3,1] => [1,1,1,1,0,1,0,0,0,0]
=> [4,1] => 4
[1,3,4,2,5] => [5,2,4,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> [5] => 5
[1,3,4,5,2] => [2,5,4,3,1] => [1,1,0,1,1,1,0,0,0,0]
=> [2,3] => 2
[1,3,5,2,4] => [4,2,5,3,1] => [1,1,1,1,0,0,1,0,0,0]
=> [4,1] => 4
[1,3,5,4,2] => [2,4,5,3,1] => [1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => 2
[1,4,2,3,5] => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> [5] => 5
[1,4,2,5,3] => [3,5,2,4,1] => [1,1,1,0,1,1,0,0,0,0]
=> [3,2] => 3
[1,4,3,2,5] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> [5] => 5
[1,4,3,5,2] => [2,5,3,4,1] => [1,1,0,1,1,1,0,0,0,0]
=> [2,3] => 2
[1,4,5,2,3] => [3,2,5,4,1] => [1,1,1,0,0,1,1,0,0,0]
=> [3,2] => 3
Description
The first part of an integer composition.
Matching statistic: St000505
Mp00089: Permutations —Inverse Kreweras complement⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
Mp00091: Set partitions —rotate increasing⟶ Set partitions
St000505: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
Mp00091: Set partitions —rotate increasing⟶ Set partitions
St000505: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => {{1}}
=> {{1}}
=> 1
[1,2] => [2,1] => {{1,2}}
=> {{1,2}}
=> 2
[2,1] => [1,2] => {{1},{2}}
=> {{1},{2}}
=> 1
[1,2,3] => [2,3,1] => {{1,2,3}}
=> {{1,2,3}}
=> 3
[1,3,2] => [3,2,1] => {{1,3},{2}}
=> {{1,2},{3}}
=> 2
[2,1,3] => [1,3,2] => {{1},{2,3}}
=> {{1,3},{2}}
=> 3
[2,3,1] => [1,2,3] => {{1},{2},{3}}
=> {{1},{2},{3}}
=> 1
[3,1,2] => [3,1,2] => {{1,3},{2}}
=> {{1,2},{3}}
=> 2
[3,2,1] => [2,1,3] => {{1,2},{3}}
=> {{1},{2,3}}
=> 1
[1,2,3,4] => [2,3,4,1] => {{1,2,3,4}}
=> {{1,2,3,4}}
=> 4
[1,2,4,3] => [2,4,3,1] => {{1,2,4},{3}}
=> {{1,2,3},{4}}
=> 3
[1,3,2,4] => [3,2,4,1] => {{1,3,4},{2}}
=> {{1,2,4},{3}}
=> 4
[1,3,4,2] => [4,2,3,1] => {{1,4},{2},{3}}
=> {{1,2},{3},{4}}
=> 2
[1,4,2,3] => [3,4,2,1] => {{1,3},{2,4}}
=> {{1,3},{2,4}}
=> 3
[1,4,3,2] => [4,3,2,1] => {{1,4},{2,3}}
=> {{1,2},{3,4}}
=> 2
[2,1,3,4] => [1,3,4,2] => {{1},{2,3,4}}
=> {{1,3,4},{2}}
=> 4
[2,1,4,3] => [1,4,3,2] => {{1},{2,4},{3}}
=> {{1,3},{2},{4}}
=> 3
[2,3,1,4] => [1,2,4,3] => {{1},{2},{3,4}}
=> {{1,4},{2},{3}}
=> 4
[2,3,4,1] => [1,2,3,4] => {{1},{2},{3},{4}}
=> {{1},{2},{3},{4}}
=> 1
[2,4,1,3] => [1,4,2,3] => {{1},{2,4},{3}}
=> {{1,3},{2},{4}}
=> 3
[2,4,3,1] => [1,3,2,4] => {{1},{2,3},{4}}
=> {{1},{2},{3,4}}
=> 1
[3,1,2,4] => [3,1,4,2] => {{1,3,4},{2}}
=> {{1,2,4},{3}}
=> 4
[3,1,4,2] => [4,1,3,2] => {{1,4},{2},{3}}
=> {{1,2},{3},{4}}
=> 2
[3,2,1,4] => [2,1,4,3] => {{1,2},{3,4}}
=> {{1,4},{2,3}}
=> 4
[3,2,4,1] => [2,1,3,4] => {{1,2},{3},{4}}
=> {{1},{2,3},{4}}
=> 1
[3,4,1,2] => [4,1,2,3] => {{1,4},{2},{3}}
=> {{1,2},{3},{4}}
=> 2
[3,4,2,1] => [3,1,2,4] => {{1,3},{2},{4}}
=> {{1},{2,4},{3}}
=> 1
[4,1,2,3] => [3,4,1,2] => {{1,3},{2,4}}
=> {{1,3},{2,4}}
=> 3
[4,1,3,2] => [4,3,1,2] => {{1,4},{2,3}}
=> {{1,2},{3,4}}
=> 2
[4,2,1,3] => [2,4,1,3] => {{1,2,4},{3}}
=> {{1,2,3},{4}}
=> 3
[4,2,3,1] => [2,3,1,4] => {{1,2,3},{4}}
=> {{1},{2,3,4}}
=> 1
[4,3,1,2] => [4,2,1,3] => {{1,4},{2},{3}}
=> {{1,2},{3},{4}}
=> 2
[4,3,2,1] => [3,2,1,4] => {{1,3},{2},{4}}
=> {{1},{2,4},{3}}
=> 1
[1,2,3,4,5] => [2,3,4,5,1] => {{1,2,3,4,5}}
=> {{1,2,3,4,5}}
=> 5
[1,2,3,5,4] => [2,3,5,4,1] => {{1,2,3,5},{4}}
=> {{1,2,3,4},{5}}
=> 4
[1,2,4,3,5] => [2,4,3,5,1] => {{1,2,4,5},{3}}
=> {{1,2,3,5},{4}}
=> 5
[1,2,4,5,3] => [2,5,3,4,1] => {{1,2,5},{3},{4}}
=> {{1,2,3},{4},{5}}
=> 3
[1,2,5,3,4] => [2,4,5,3,1] => {{1,2,4},{3,5}}
=> {{1,4},{2,3,5}}
=> 4
[1,2,5,4,3] => [2,5,4,3,1] => {{1,2,5},{3,4}}
=> {{1,2,3},{4,5}}
=> 3
[1,3,2,4,5] => [3,2,4,5,1] => {{1,3,4,5},{2}}
=> {{1,2,4,5},{3}}
=> 5
[1,3,2,5,4] => [3,2,5,4,1] => {{1,3,5},{2},{4}}
=> {{1,2,4},{3},{5}}
=> 4
[1,3,4,2,5] => [4,2,3,5,1] => {{1,4,5},{2},{3}}
=> {{1,2,5},{3},{4}}
=> 5
[1,3,4,5,2] => [5,2,3,4,1] => {{1,5},{2},{3},{4}}
=> {{1,2},{3},{4},{5}}
=> 2
[1,3,5,2,4] => [4,2,5,3,1] => {{1,4},{2},{3,5}}
=> {{1,4},{2,5},{3}}
=> 4
[1,3,5,4,2] => [5,2,4,3,1] => {{1,5},{2},{3,4}}
=> {{1,2},{3},{4,5}}
=> 2
[1,4,2,3,5] => [3,4,2,5,1] => {{1,3},{2,4,5}}
=> {{1,3,5},{2,4}}
=> 5
[1,4,2,5,3] => [3,5,2,4,1] => {{1,3},{2,5},{4}}
=> {{1,3},{2,4},{5}}
=> 3
[1,4,3,2,5] => [4,3,2,5,1] => {{1,4,5},{2,3}}
=> {{1,2,5},{3,4}}
=> 5
[1,4,3,5,2] => [5,3,2,4,1] => {{1,5},{2,3},{4}}
=> {{1,2},{3,4},{5}}
=> 2
[1,4,5,2,3] => [4,5,2,3,1] => {{1,4},{2,5},{3}}
=> {{1,3},{2,5},{4}}
=> 3
Description
The biggest entry in the block containing the 1.
Matching statistic: St000971
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00064: Permutations —reverse⟶ Permutations
Mp00235: Permutations —descent views to invisible inversion bottoms⟶ Permutations
Mp00151: Permutations —to cycle type⟶ Set partitions
St000971: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00235: Permutations —descent views to invisible inversion bottoms⟶ Permutations
Mp00151: Permutations —to cycle type⟶ Set partitions
St000971: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1] => {{1}}
=> 1
[1,2] => [2,1] => [2,1] => {{1,2}}
=> 2
[2,1] => [1,2] => [1,2] => {{1},{2}}
=> 1
[1,2,3] => [3,2,1] => [2,3,1] => {{1,2,3}}
=> 3
[1,3,2] => [2,3,1] => [3,2,1] => {{1,3},{2}}
=> 2
[2,1,3] => [3,1,2] => [3,1,2] => {{1,2,3}}
=> 3
[2,3,1] => [1,3,2] => [1,3,2] => {{1},{2,3}}
=> 1
[3,1,2] => [2,1,3] => [2,1,3] => {{1,2},{3}}
=> 2
[3,2,1] => [1,2,3] => [1,2,3] => {{1},{2},{3}}
=> 1
[1,2,3,4] => [4,3,2,1] => [2,3,4,1] => {{1,2,3,4}}
=> 4
[1,2,4,3] => [3,4,2,1] => [2,4,3,1] => {{1,2,4},{3}}
=> 3
[1,3,2,4] => [4,2,3,1] => [3,4,2,1] => {{1,2,3,4}}
=> 4
[1,3,4,2] => [2,4,3,1] => [3,2,4,1] => {{1,3,4},{2}}
=> 2
[1,4,2,3] => [3,2,4,1] => [4,3,2,1] => {{1,4},{2,3}}
=> 3
[1,4,3,2] => [2,3,4,1] => [4,2,3,1] => {{1,4},{2},{3}}
=> 2
[2,1,3,4] => [4,3,1,2] => [3,1,4,2] => {{1,2,3,4}}
=> 4
[2,1,4,3] => [3,4,1,2] => [4,1,3,2] => {{1,2,4},{3}}
=> 3
[2,3,1,4] => [4,1,3,2] => [4,3,1,2] => {{1,2,3,4}}
=> 4
[2,3,4,1] => [1,4,3,2] => [1,3,4,2] => {{1},{2,3,4}}
=> 1
[2,4,1,3] => [3,1,4,2] => [3,4,1,2] => {{1,3},{2,4}}
=> 3
[2,4,3,1] => [1,3,4,2] => [1,4,3,2] => {{1},{2,4},{3}}
=> 1
[3,1,2,4] => [4,2,1,3] => [2,4,1,3] => {{1,2,3,4}}
=> 4
[3,1,4,2] => [2,4,1,3] => [4,2,1,3] => {{1,3,4},{2}}
=> 2
[3,2,1,4] => [4,1,2,3] => [4,1,2,3] => {{1,2,3,4}}
=> 4
[3,2,4,1] => [1,4,2,3] => [1,4,2,3] => {{1},{2,3,4}}
=> 1
[3,4,1,2] => [2,1,4,3] => [2,1,4,3] => {{1,2},{3,4}}
=> 2
[3,4,2,1] => [1,2,4,3] => [1,2,4,3] => {{1},{2},{3,4}}
=> 1
[4,1,2,3] => [3,2,1,4] => [2,3,1,4] => {{1,2,3},{4}}
=> 3
[4,1,3,2] => [2,3,1,4] => [3,2,1,4] => {{1,3},{2},{4}}
=> 2
[4,2,1,3] => [3,1,2,4] => [3,1,2,4] => {{1,2,3},{4}}
=> 3
[4,2,3,1] => [1,3,2,4] => [1,3,2,4] => {{1},{2,3},{4}}
=> 1
[4,3,1,2] => [2,1,3,4] => [2,1,3,4] => {{1,2},{3},{4}}
=> 2
[4,3,2,1] => [1,2,3,4] => [1,2,3,4] => {{1},{2},{3},{4}}
=> 1
[1,2,3,4,5] => [5,4,3,2,1] => [2,3,4,5,1] => {{1,2,3,4,5}}
=> 5
[1,2,3,5,4] => [4,5,3,2,1] => [2,3,5,4,1] => {{1,2,3,5},{4}}
=> 4
[1,2,4,3,5] => [5,3,4,2,1] => [2,4,5,3,1] => {{1,2,3,4,5}}
=> 5
[1,2,4,5,3] => [3,5,4,2,1] => [2,4,3,5,1] => {{1,2,4,5},{3}}
=> 3
[1,2,5,3,4] => [4,3,5,2,1] => [2,5,4,3,1] => {{1,2,5},{3,4}}
=> 4
[1,2,5,4,3] => [3,4,5,2,1] => [2,5,3,4,1] => {{1,2,5},{3},{4}}
=> 3
[1,3,2,4,5] => [5,4,2,3,1] => [3,4,2,5,1] => {{1,2,3,4,5}}
=> 5
[1,3,2,5,4] => [4,5,2,3,1] => [3,5,2,4,1] => {{1,2,3,5},{4}}
=> 4
[1,3,4,2,5] => [5,2,4,3,1] => [3,4,5,1,2] => {{1,2,3,4,5}}
=> 5
[1,3,4,5,2] => [2,5,4,3,1] => [3,2,4,5,1] => {{1,3,4,5},{2}}
=> 2
[1,3,5,2,4] => [4,2,5,3,1] => [3,5,4,1,2] => {{1,3,4},{2,5}}
=> 4
[1,3,5,4,2] => [2,4,5,3,1] => [3,2,5,4,1] => {{1,3,5},{2},{4}}
=> 2
[1,4,2,3,5] => [5,3,2,4,1] => [4,3,5,2,1] => {{1,2,3,4,5}}
=> 5
[1,4,2,5,3] => [3,5,2,4,1] => [4,5,3,2,1] => {{1,2,4,5},{3}}
=> 3
[1,4,3,2,5] => [5,2,3,4,1] => [4,5,2,3,1] => {{1,2,3,4,5}}
=> 5
[1,4,3,5,2] => [2,5,3,4,1] => [4,2,5,3,1] => {{1,3,4,5},{2}}
=> 2
[1,4,5,2,3] => [3,2,5,4,1] => [4,3,2,5,1] => {{1,4,5},{2,3}}
=> 3
Description
The smallest closer of a set partition.
A closer (or right hand endpoint) of a set partition is a number that is maximal in its block. For this statistic, singletons are considered as closers.
In other words, this is the smallest among the maximal elements of the blocks.
Matching statistic: St000476
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00066: Permutations —inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St000476: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St000476: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> [1,0]
=> ? = 1 - 1
[1,2] => [1,2] => [1,0,1,0]
=> [1,0,1,0]
=> 1 = 2 - 1
[2,1] => [2,1] => [1,1,0,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 2 = 3 - 1
[1,3,2] => [1,3,2] => [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2 = 3 - 1
[2,3,1] => [3,1,2] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[3,1,2] => [2,3,1] => [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[3,2,1] => [3,2,1] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,2,4,3] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,3,2,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[1,3,4,2] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,4,2,3] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,4,3,2] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 4 - 1
[2,1,4,3] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[2,3,1,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[2,3,4,1] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[2,4,1,3] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[2,4,3,1] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[3,1,2,4] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 4 - 1
[3,1,4,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[3,2,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[3,2,4,1] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[3,4,1,2] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[3,4,2,1] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[4,1,2,3] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[4,1,3,2] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[4,2,1,3] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[4,2,3,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[4,3,1,2] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[4,3,2,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,2,3,5,4] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[1,2,4,3,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 5 - 1
[1,2,4,5,3] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,2,5,3,4] => [1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[1,2,5,4,3] => [1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,3,2,4,5] => [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4 = 5 - 1
[1,3,2,5,4] => [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 4 - 1
[1,3,4,2,5] => [1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 4 = 5 - 1
[1,3,4,5,2] => [1,5,2,3,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,3,5,2,4] => [1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 4 - 1
[1,3,5,4,2] => [1,5,2,4,3] => [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,4,2,3,5] => [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 5 - 1
[1,4,2,5,3] => [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,4,3,2,5] => [1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 4 = 5 - 1
[1,4,3,5,2] => [1,5,3,2,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,4,5,2,3] => [1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,4,5,3,2] => [1,5,4,2,3] => [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
Description
The sum of the semi-lengths of tunnels before a valley of a Dyck path.
For each valley $v$ in a Dyck path $D$ there is a corresponding tunnel, which
is the factor $T_v = s_i\dots s_j$ of $D$ where $s_i$ is the step after the first intersection of $D$ with the line $y = ht(v)$ to the left of $s_j$. This statistic is
$$
\sum_v (j_v-i_v)/2.
$$
The following 34 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000147The largest part of an integer partition. St000054The first entry of the permutation. St000141The maximum drop size of a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000989The number of final rises of a permutation. St000653The last descent of a permutation. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000051The size of the left subtree of a binary tree. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000297The number of leading ones in a binary word. St000542The number of left-to-right-minima of a permutation. St000991The number of right-to-left minima of a permutation. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001497The position of the largest weak excedence of a permutation. St000133The "bounce" of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000738The first entry in the last row of a standard tableau. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St000061The number of nodes on the left branch of a binary tree. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St001480The number of simple summands of the module J^2/J^3. St000326The position of the first one in a binary word after appending a 1 at the end. St000391The sum of the positions of the ones in a binary word. St001313The number of Dyck paths above the lattice path given by a binary word. St000682The Grundy value of Welter's game on a binary word. St000840The number of closers smaller than the largest opener in a perfect matching. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000199The column of the unique '1' in the last row of the alternating sign matrix. St001434The number of negative sum pairs of a signed permutation. St001430The number of positive entries in a signed permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation.
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!