searching the database
Your data matches 61 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: St000025
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 3
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 4
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
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: St000011
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00032: Dyck paths —inverse zeta map⟶ 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%
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,0]
=> [1,0]
=> [1,0]
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 3
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 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]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 3
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 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
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 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]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2
[1,1,0,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]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
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: St000745
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00059: Permutations —Robinson-Schensted insertion tableau⟶ Standard tableaux
St000745: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00059: Permutations —Robinson-Schensted insertion tableau⟶ Standard tableaux
St000745: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => [[1]]
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => [[1],[2]]
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => [[1,2]]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => [[1],[2],[3]]
=> 3
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => [[1,2],[3]]
=> 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => [[1,3],[2]]
=> 2
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => [[1,3],[2]]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => [[1,2,3]]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [[1],[2],[3],[4]]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [[1,2],[3],[4]]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [[1,3],[2],[4]]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [[1,4],[2],[3]]
=> 3
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [[1,2,3],[4]]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [[1,4],[2],[3]]
=> 3
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [[1,2,4],[3]]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [[1,4],[2],[3]]
=> 3
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [[1,3],[2,4]]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [[1,2,4],[3]]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[1,3,4],[2]]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [[1,3,4],[2]]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [[1,3,4],[2]]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [[1,2,3,4]]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,4,3,2,1] => [[1],[2],[3],[4],[5]]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [[1,2],[3],[4],[5]]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [[1,3],[2],[4],[5]]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => [[1,5],[2],[3],[4]]
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [[1,2,3],[4],[5]]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [3,5,4,2,1] => [[1,4],[2],[3],[5]]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [[1,2,4],[3],[5]]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => [[1,5],[2],[3],[4]]
=> 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [[1,3],[2,4],[5]]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [[1,2,5],[3],[4]]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [[1,3,4],[2],[5]]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [[1,3,5],[2],[4]]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [[1,4,5],[2],[3]]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [[1,2,3,4],[5]]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,5,3,2,1] => [[1,5],[2],[3],[4]]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [[1,2,5],[3],[4]]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [[1,3,5],[2],[4]]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,4,2,1,5] => [[1,4,5],[2],[3]]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [[1,2,3,5],[4]]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,3,5,2,1] => [[1,5],[2],[3],[4]]
=> 4
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [[1,2,5],[3],[4]]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2,5,4,1] => [[1,4],[2,5],[3]]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => [[1,4],[2,5],[3]]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [[1,2,4],[3,5]]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [[1,3,5],[2],[4]]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => [[1,4,5],[2],[3]]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [[1,3,4],[2,5]]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [[1,2,3,5],[4]]
=> 1
Description
The index of the last row whose first entry is the row number in a standard Young tableau.
Matching statistic: St000382
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00199: Dyck paths —prime 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%
Mp00199: Dyck paths —prime 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,0]
=> [1,0]
=> [1,1,0,0]
=> [2] => 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [3] => 3 = 2 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,1] => 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => 4 = 3 + 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5] => 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,3] => 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [3,2] => 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1] => 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,1] => 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,1] => 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2] => 3 = 2 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [3,1,1] => 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,1,1] => 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,1,1] => 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [6] => 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [2,4] => 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [3,3] => 3 = 2 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [5,1] => 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [2,1,3] => 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [4,2] => 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,2,2] => 2 = 1 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [5,1] => 5 = 4 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [3,3] => 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [2,3,1] => 2 = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [3,1,2] => 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [3,2,1] => 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [4,1,1] => 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [2,1,1,2] => 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [5,1] => 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [2,3,1] => 2 = 1 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [3,2,1] => 3 = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [4,1,1] => 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [2,1,2,1] => 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [5,1] => 5 = 4 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [2,3,1] => 2 = 1 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [4,2] => 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [4,2] => 4 = 3 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [2,2,2] => 2 = 1 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [3,2,1] => 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [4,1,1] => 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [3,1,2] => 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [2,1,2,1] => 2 = 1 + 1
Description
The first part of an integer composition.
Matching statistic: St000439
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St000439: Dyck paths ⟶ ℤResult quality: 88% ●values known / values provided: 100%●distinct values known / distinct values provided: 88%
St000439: Dyck paths ⟶ ℤResult quality: 88% ●values known / values provided: 100%●distinct values known / distinct values provided: 88%
Values
[1,0]
=> [1,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 2 = 1 + 1
[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,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[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,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[]
=> []
=> ? = 0 + 1
Description
The position of the first down step of a Dyck path.
Matching statistic: St000971
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000971: Set partitions ⟶ ℤResult quality: 88% ●values known / values provided: 100%●distinct values known / distinct values provided: 88%
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000971: Set partitions ⟶ ℤResult quality: 88% ●values known / values provided: 100%●distinct values known / distinct values provided: 88%
Values
[1,0]
=> [1,0]
=> {{1}}
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> {{1,2}}
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> {{1},{2}}
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> {{1,2,3}}
=> 3
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> {{1},{2,3}}
=> 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> {{1,3},{2}}
=> 2
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> {{1,2},{3}}
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 4
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 3
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 3
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 3
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> {{1,2,3,4,5}}
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> {{1,2,3,4},{5}}
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> {{1,2,4,5},{3}}
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> {{1,5},{2,3,4}}
=> 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> {{1,3,4},{2},{5}}
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> {{1,2,3},{4},{5}}
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> {{1,2,3,5},{4}}
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> {{1},{2,3,5},{4}}
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> {{1,2,4},{3},{5}}
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3,5},{4}}
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> {{1,2,5},{3,4}}
=> 4
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> {{1,4,5},{2,3}}
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> {{1,2,3},{4,5}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> {{1,4},{2,3},{5}}
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 1
[]
=> []
=> {}
=> ? = 0
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: St000026
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000026: Dyck paths ⟶ ℤResult quality: 88% ●values known / values provided: 100%●distinct values known / distinct values provided: 88%
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000026: Dyck paths ⟶ ℤResult quality: 88% ●values known / values provided: 100%●distinct values known / distinct values provided: 88%
Values
[1,0]
=> [1,0]
=> [1] => [1,0]
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> [2] => [1,1,0,0]
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 3
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[]
=> []
=> [] => ?
=> ? = 0
Description
The position of the first return of a Dyck path.
Matching statistic: St000383
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00038: Integer compositions —reverse⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 88% ●values known / values provided: 100%●distinct values known / distinct values provided: 88%
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00038: Integer compositions —reverse⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 88% ●values known / values provided: 100%●distinct values known / distinct values provided: 88%
Values
[1,0]
=> [1,0]
=> [1] => [1] => 1
[1,0,1,0]
=> [1,1,0,0]
=> [2] => [2] => 2
[1,1,0,0]
=> [1,0,1,0]
=> [1,1] => [1,1] => 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3] => [3] => 3
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,2] => [2,1] => 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [2,1] => [1,2] => 2
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1] => [1,2] => 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1] => [1,1,1] => 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => [4] => 4
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => [3,1] => 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => [2,2] => 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => [1,3] => 3
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => [2,1,1] => 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => [1,3] => 3
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,2,1] => 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => [1,3] => 3
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => [2,2] => 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,2,1] => 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,2] => 2
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,2] => 2
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,2] => 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,1,1,1] => 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5] => [5] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [4,1] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [3,2] => 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => [1,4] => 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [3,1,1] => 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [3,2] => [2,3] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [2,2,1] => 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1] => [1,4] => 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [3,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,3,1] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [2,1,2] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,2,2] => 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,3] => 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [2,1,1,1] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,1] => [1,4] => 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,3,1] => 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,2,2] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,1,1] => [1,1,3] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,2,1,1] => 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,1] => [1,4] => 4
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,3,1] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2] => [2,3] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => [2,3] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [2,2,1] => 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,2,2] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,1] => [1,1,3] => 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [2,1,2] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,2,1,1] => 1
[]
=> []
=> [] => [] => ? = 0
Description
The last part of an integer composition.
Matching statistic: St001784
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St001784: Set partitions ⟶ ℤResult quality: 88% ●values known / values provided: 100%●distinct values known / distinct values provided: 88%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St001784: Set partitions ⟶ ℤResult quality: 88% ●values known / values provided: 100%●distinct values known / distinct values provided: 88%
Values
[1,0]
=> [1,0]
=> [1] => {{1}}
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => {{1,2}}
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => {{1},{2}}
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,1,2] => {{1,3},{2}}
=> 3
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => {{1},{2,3}}
=> 1
[1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => {{1,2,3}}
=> 2
[1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => {{1,2},{3}}
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => {{1},{2},{3}}
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => {{1,4},{2},{3}}
=> 4
[1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => {{1},{2,4},{3}}
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,1,3] => {{1,2,4},{3}}
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => {{1,3},{2},{4}}
=> 3
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => {{1},{2},{3,4}}
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [3,4,1,2] => {{1,3},{2,4}}
=> 3
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => {{1},{2,3,4}}
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1,4,2] => {{1,3,4},{2}}
=> 3
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => {{1,2},{3,4}}
=> 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => {{1},{2,3},{4}}
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => {{1,2,3,4}}
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => {{1,2,3},{4}}
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => {{1,2},{3},{4}}
=> 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => {{1},{2},{3},{4}}
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,1,2,3,4] => {{1,5},{2},{3},{4}}
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => {{1},{2,5},{3},{4}}
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => {{1,2,5},{3},{4}}
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1,2,3,5] => {{1,4},{2},{3},{5}}
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [3,5,1,2,4] => {{1,3},{2,5},{4}}
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => {{1},{2,3,5},{4}}
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1,2,5,3] => {{1,4,5},{2},{3}}
=> 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => {{1,2},{3,5},{4}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => {{1},{2,4},{3},{5}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => {{1,2,3,5},{4}}
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => {{1,2,4},{3},{5}}
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,2,4,5] => {{1,3},{2},{4},{5}}
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,5,1,2,3] => {{1,4},{2,5},{3}}
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => {{1},{2,4},{3,5}}
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => {{1,2,4},{3,5}}
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,4,1,2,5] => {{1,3},{2,4},{5}}
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => {{1},{2},{3,4,5}}
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,1,5,2,3] => {{1,4},{2},{3,5}}
=> 4
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => {{1},{2,4,5},{3}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,1,5,2,4] => {{1,3,5},{2},{4}}
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,1,2,5,4] => {{1,3},{2},{4,5}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => {{1,2,4,5},{3}}
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,1,4,2,5] => {{1,3,4},{2},{5}}
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> 1
[]
=> []
=> [] => ?
=> ? = 0
Description
The minimum of the smallest closer and the second element of the block containing 1 in a set partition.
A closer of a set partition is the maximal element of a non-singleton block. This statistic is defined as $1$ if $\{1\}$ is a singleton block, and otherwise the minimum of the smallest closer and the second element of the block containing $1$.
Matching statistic: St000504
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
Mp00091: Set partitions —rotate increasing⟶ Set partitions
St000504: Set partitions ⟶ ℤResult quality: 88% ●values known / values provided: 100%●distinct values known / distinct values provided: 88%
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
Mp00091: Set partitions —rotate increasing⟶ Set partitions
St000504: Set partitions ⟶ ℤResult quality: 88% ●values known / values provided: 100%●distinct values known / distinct values provided: 88%
Values
[1,0]
=> [1] => {{1}}
=> {{1}}
=> ? = 1
[1,0,1,0]
=> [2,1] => {{1,2}}
=> {{1,2}}
=> 2
[1,1,0,0]
=> [1,2] => {{1},{2}}
=> {{1},{2}}
=> 1
[1,0,1,0,1,0]
=> [2,3,1] => {{1,2,3}}
=> {{1,2,3}}
=> 3
[1,0,1,1,0,0]
=> [2,1,3] => {{1,2},{3}}
=> {{1},{2,3}}
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => {{1},{2,3}}
=> {{1,3},{2}}
=> 2
[1,1,0,1,0,0]
=> [3,1,2] => {{1,3},{2}}
=> {{1,2},{3}}
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => {{1},{2},{3}}
=> {{1},{2},{3}}
=> 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => {{1,2,3,4}}
=> {{1,2,3,4}}
=> 4
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => {{1,2,3},{4}}
=> {{1},{2,3,4}}
=> 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => {{1,2},{3,4}}
=> {{1,4},{2,3}}
=> 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => {{1,2,4},{3}}
=> {{1,2,3},{4}}
=> 3
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => {{1,2},{3},{4}}
=> {{1},{2,3},{4}}
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => {{1},{2,3,4}}
=> {{1,3,4},{2}}
=> 3
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => {{1},{2,3},{4}}
=> {{1},{2},{3,4}}
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => {{1,3,4},{2}}
=> {{1,2,4},{3}}
=> 3
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => {{1,3},{2,4}}
=> {{1,3},{2,4}}
=> 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => {{1,3},{2},{4}}
=> {{1},{2,4},{3}}
=> 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => {{1},{2},{3,4}}
=> {{1,4},{2},{3}}
=> 2
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => {{1},{2,4},{3}}
=> {{1,3},{2},{4}}
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => {{1,4},{2},{3}}
=> {{1,2},{3},{4}}
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => {{1},{2},{3},{4}}
=> {{1},{2},{3},{4}}
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => {{1,2,3,4,5}}
=> {{1,2,3,4,5}}
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => {{1,2,3,4},{5}}
=> {{1},{2,3,4,5}}
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => {{1,2,3},{4,5}}
=> {{1,5},{2,3,4}}
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => {{1,2,3,5},{4}}
=> {{1,2,3,4},{5}}
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => {{1,2,3},{4},{5}}
=> {{1},{2,3,4},{5}}
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => {{1,2},{3,4,5}}
=> {{1,4,5},{2,3}}
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => {{1,2},{3,4},{5}}
=> {{1},{2,3},{4,5}}
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => {{1,2,4,5},{3}}
=> {{1,2,3,5},{4}}
=> 4
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => {{1,2,4},{3,5}}
=> {{1,4},{2,3,5}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => {{1,2,4},{3},{5}}
=> {{1},{2,3,5},{4}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> {{1,5},{2,3},{4}}
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => {{1,2},{3,5},{4}}
=> {{1,4},{2,3},{5}}
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => {{1,2,5},{3},{4}}
=> {{1,2,3},{4},{5}}
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => {{1,2},{3},{4},{5}}
=> {{1},{2,3},{4},{5}}
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => {{1},{2,3,4,5}}
=> {{1,3,4,5},{2}}
=> 4
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => {{1},{2,3,4},{5}}
=> {{1},{2},{3,4,5}}
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> {{1,5},{2},{3,4}}
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => {{1},{2,3,5},{4}}
=> {{1,3,4},{2},{5}}
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> {{1},{2},{3,4},{5}}
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => {{1,3,4,5},{2}}
=> {{1,2,4,5},{3}}
=> 4
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => {{1,3,4},{2},{5}}
=> {{1},{2,4,5},{3}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => {{1,3},{2,4,5}}
=> {{1,3,5},{2,4}}
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => {{1,3,5},{2,4}}
=> {{1,2,4},{3,5}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => {{1,3},{2,4},{5}}
=> {{1},{2,4},{3,5}}
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => {{1,3},{2},{4,5}}
=> {{1,5},{2,4},{3}}
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => {{1,3,5},{2},{4}}
=> {{1,2,4},{3},{5}}
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => {{1,3},{2,5},{4}}
=> {{1,3},{2,4},{5}}
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => {{1,3},{2},{4},{5}}
=> {{1},{2,4},{3},{5}}
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => {{1},{2},{3,4,5}}
=> {{1,4,5},{2},{3}}
=> 3
[]
=> [] => ?
=> ?
=> ? = 0
Description
The cardinality of the first block of a set partition.
The number of partitions of $\{1,\ldots,n\}$ into $k$ blocks in which the first block has cardinality $j+1$ is given by $\binom{n-1}{j}S(n-j-1,k-1)$, see [1, Theorem 1.1] and the references therein. Here, $S(n,k)$ are the ''Stirling numbers of the second kind'' counting all set partitions of $\{1,\ldots,n\}$ into $k$ blocks [2].
The following 51 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000675The number of centered multitunnels of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000297The number of leading ones in a binary word. St000234The number of global ascents of a permutation. St000069The number of maximal elements of a poset. St000068The number of minimal elements in a poset. St000717The number of ordinal summands of a poset. St000054The first entry of the permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St000542The number of left-to-right-minima of a permutation. St000654The first descent of a permutation. St000989The number of final rises 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. St000007The number of saliances of the permutation. St000990The first ascent of a permutation. St000740The last entry of a permutation. St000203The number of external nodes of a binary tree. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000738The first entry in the last row of a standard tableau. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000843The decomposition number of a perfect matching. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000734The last entry in the first row of a standard tableau. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. 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. St000056The decomposition (or block) number of a permutation. St000084The number of subtrees. St000314The number of left-to-right-maxima of a permutation. St000326The position of the first one in a binary word after appending a 1 at the end. St000352The Elizalde-Pak rank of a permutation. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St000051The size of the left subtree of a binary tree. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St000061The number of nodes on the left branch of a binary tree. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St000260The radius of a connected graph. 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. St000200The row of the unique '1' in the last column of the alternating sign matrix. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001462The number of factors of a standard tableaux under concatenation. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001937The size of the center of a parking function. St001621The number of atoms of a lattice.
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!