searching the database
Your data matches 317 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: St001091
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
St001091: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 0
[2]
=> 0
[1,1]
=> 1
[3]
=> 0
[2,1]
=> 0
[1,1,1]
=> 2
[4]
=> 0
[3,1]
=> 0
[2,2]
=> 1
[2,1,1]
=> 1
[1,1,1,1]
=> 3
[5]
=> 0
[4,1]
=> 0
[3,2]
=> 0
[3,1,1]
=> 1
[2,2,1]
=> 1
[2,1,1,1]
=> 2
[1,1,1,1,1]
=> 4
[6]
=> 0
[5,1]
=> 0
[4,2]
=> 0
[4,1,1]
=> 1
[3,3]
=> 1
[3,2,1]
=> 0
[3,1,1,1]
=> 2
[2,2,2]
=> 2
[2,2,1,1]
=> 2
[2,1,1,1,1]
=> 3
[1,1,1,1,1,1]
=> 5
[7]
=> 0
[6,1]
=> 0
[5,2]
=> 0
[5,1,1]
=> 1
[4,3]
=> 0
[4,2,1]
=> 0
[4,1,1,1]
=> 2
[3,3,1]
=> 1
[3,2,2]
=> 1
[3,2,1,1]
=> 1
[3,1,1,1,1]
=> 3
[2,2,2,1]
=> 2
[2,2,1,1,1]
=> 3
[2,1,1,1,1,1]
=> 4
[1,1,1,1,1,1,1]
=> 6
Description
The number of parts in an integer partition whose next smaller part has the same size.
In other words, this is the number of distinct parts subtracted from the number of all parts.
Matching statistic: St000052
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00032: Dyck paths —inverse zeta map⟶ 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,0]
=> [1,1,0,0]
=> 0
[2]
=> [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 0
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[2,1]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 0
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 4
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 0
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 0
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> 5
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 3
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 0
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 0
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 0
[7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> 6
[6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> 4
[5,2]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 3
[5,1,1]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 3
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[3,1,1,1,1]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> 1
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 0
[2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> 0
[2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 0
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.
Matching statistic: St000356
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000356: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000356: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [1,2] => 0
[2]
=> [1,1,0,0,1,0]
=> [2,1,3] => 0
[1,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 0
[2,1]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 2
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => 0
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 0
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 3
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [5,4,3,2,1,6] => 0
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,4,2,1,5] => 0
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => 2
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,6,5,4,3,2] => 4
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [6,5,4,3,2,1,7] => 0
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [4,5,3,2,1,6] => 0
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => 0
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => 1
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 2
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 2
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 2
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,5,6,4,3,2] => 3
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,7,6,5,4,3,2] => 5
[7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [7,6,5,4,3,2,1,8] => 0
[6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [5,6,4,3,2,1,7] => 0
[5,2]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [4,3,5,2,1,6] => 0
[5,1,1]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [3,5,4,2,1,6] => 1
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 0
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 0
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 2
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 1
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 1
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 1
[3,1,1,1,1]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,5,4,6,3,2] => 3
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 2
[2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,4,6,5,3,2] => 3
[2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,6,7,5,4,3,2] => 4
[1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,8,7,6,5,4,3,2] => 6
Description
The number of occurrences of the pattern 13-2.
See [[Permutations/#Pattern-avoiding_permutations]] for the definition of the pattern $13\!\!-\!\!2$.
Matching statistic: St001067
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001067: 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
St001067: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> 0
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 0
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 0
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 0
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 0
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 2
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 3
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 0
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 0
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 0
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> 0
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> 2
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> 3
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 3
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> 4
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
Description
The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St001777
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
Mp00207: Standard tableaux —horizontal strip sizes⟶ Integer compositions
St001777: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00207: Standard tableaux —horizontal strip sizes⟶ Integer compositions
St001777: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> [1] => 0
[2]
=> [[1,2]]
=> [2] => 0
[1,1]
=> [[1],[2]]
=> [1,1] => 1
[3]
=> [[1,2,3]]
=> [3] => 0
[2,1]
=> [[1,3],[2]]
=> [1,2] => 0
[1,1,1]
=> [[1],[2],[3]]
=> [1,1,1] => 2
[4]
=> [[1,2,3,4]]
=> [4] => 0
[3,1]
=> [[1,3,4],[2]]
=> [1,3] => 0
[2,2]
=> [[1,2],[3,4]]
=> [2,2] => 1
[2,1,1]
=> [[1,4],[2],[3]]
=> [1,1,2] => 1
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [1,1,1,1] => 3
[5]
=> [[1,2,3,4,5]]
=> [5] => 0
[4,1]
=> [[1,3,4,5],[2]]
=> [1,4] => 0
[3,2]
=> [[1,2,5],[3,4]]
=> [2,3] => 0
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [1,1,3] => 1
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [1,2,2] => 1
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> [1,1,1,2] => 2
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [1,1,1,1,1] => 4
[6]
=> [[1,2,3,4,5,6]]
=> [6] => 0
[5,1]
=> [[1,3,4,5,6],[2]]
=> [1,5] => 0
[4,2]
=> [[1,2,5,6],[3,4]]
=> [2,4] => 0
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [1,1,4] => 1
[3,3]
=> [[1,2,3],[4,5,6]]
=> [3,3] => 1
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [1,2,3] => 0
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> [1,1,1,3] => 2
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [2,2,2] => 2
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [1,1,2,2] => 2
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> [1,1,1,1,2] => 3
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [1,1,1,1,1,1] => 5
[7]
=> [[1,2,3,4,5,6,7]]
=> [7] => 0
[6,1]
=> [[1,3,4,5,6,7],[2]]
=> [1,6] => 0
[5,2]
=> [[1,2,5,6,7],[3,4]]
=> [2,5] => 0
[5,1,1]
=> [[1,4,5,6,7],[2],[3]]
=> [1,1,5] => 1
[4,3]
=> [[1,2,3,7],[4,5,6]]
=> [3,4] => 0
[4,2,1]
=> [[1,3,6,7],[2,5],[4]]
=> [1,2,4] => 0
[4,1,1,1]
=> [[1,5,6,7],[2],[3],[4]]
=> [1,1,1,4] => 2
[3,3,1]
=> [[1,3,4],[2,6,7],[5]]
=> [1,3,3] => 1
[3,2,2]
=> [[1,2,7],[3,4],[5,6]]
=> [2,2,3] => 1
[3,2,1,1]
=> [[1,4,7],[2,6],[3],[5]]
=> [1,1,2,3] => 1
[3,1,1,1,1]
=> [[1,6,7],[2],[3],[4],[5]]
=> [1,1,1,1,3] => 3
[2,2,2,1]
=> [[1,3],[2,5],[4,7],[6]]
=> [1,2,2,2] => 2
[2,2,1,1,1]
=> [[1,5],[2,7],[3],[4],[6]]
=> [1,1,1,2,2] => 3
[2,1,1,1,1,1]
=> [[1,7],[2],[3],[4],[5],[6]]
=> [1,1,1,1,1,2] => 4
[1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> [1,1,1,1,1,1,1] => 6
Description
The number of weak descents in an integer composition.
A weak descent of an integer composition $\alpha=(a_1, \dots, a_n)$ is an index $1\leq i < n$ such that $a_i \geq a_{i+1}$.
Matching statistic: St000451
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000451: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000451: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [2,1] => 2 = 0 + 2
[2]
=> [1,1,0,0,1,0]
=> [3,1,2] => 3 = 1 + 2
[1,1]
=> [1,0,1,1,0,0]
=> [2,3,1] => 2 = 0 + 2
[3]
=> [1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 4 = 2 + 2
[2,1]
=> [1,0,1,0,1,0]
=> [3,2,1] => 2 = 0 + 2
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 2 = 0 + 2
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => 5 = 3 + 2
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [4,2,1,3] => 3 = 1 + 2
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 3 = 1 + 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [3,2,4,1] => 2 = 0 + 2
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 2 = 0 + 2
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [6,1,2,3,4,5] => 6 = 4 + 2
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,3,4] => 4 = 2 + 2
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 3 = 1 + 2
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [4,2,3,1] => 3 = 1 + 2
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 2 = 0 + 2
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => 2 = 0 + 2
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => 2 = 0 + 2
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [7,1,2,3,4,5,6] => 7 = 5 + 2
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [6,2,1,3,4,5] => 5 = 3 + 2
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,2,4] => 4 = 2 + 2
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => 4 = 2 + 2
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => 4 = 2 + 2
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 2 = 0 + 2
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => 3 = 1 + 2
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => 3 = 1 + 2
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => 2 = 0 + 2
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [3,2,4,5,6,1] => 2 = 0 + 2
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [2,3,4,5,6,7,1] => 2 = 0 + 2
[7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [8,1,2,3,4,5,6,7] => 8 = 6 + 2
[6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [7,2,1,3,4,5,6] => 6 = 4 + 2
[5,2]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [6,3,1,2,4,5] => 5 = 3 + 2
[5,1,1]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [6,2,3,1,4,5] => 5 = 3 + 2
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => 4 = 2 + 2
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => 3 = 1 + 2
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => 4 = 2 + 2
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => 3 = 1 + 2
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => 3 = 1 + 2
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => 2 = 0 + 2
[3,1,1,1,1]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [4,2,3,5,6,1] => 3 = 1 + 2
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => 2 = 0 + 2
[2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [3,4,2,5,6,1] => 2 = 0 + 2
[2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [3,2,4,5,6,7,1] => 2 = 0 + 2
[1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [2,3,4,5,6,7,8,1] => 2 = 0 + 2
Description
The length of the longest pattern of the form k 1 2...(k-1).
Matching statistic: St000065
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00327: Dyck paths —inverse Kreweras complement⟶ Dyck paths
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
St000065: Alternating sign matrices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00327: Dyck paths —inverse Kreweras complement⟶ Dyck paths
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
St000065: Alternating sign matrices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [1,1,0,0]
=> [[0,1],[1,0]]
=> 0
[2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> 0
[1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> 0
[2,1]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> 2
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 0
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> 0
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 3
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> 0
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 0
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> 0
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 2
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0,0],[1,-1,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> 4
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0,0,0],[0,1,0,0,0,0,0],[0,0,1,0,0,0,0],[0,0,0,1,0,0,0],[0,0,0,0,1,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0]]
=> 0
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> 0
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 0
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 1
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> 0
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 2
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 2
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [[0,0,1,0,0],[1,0,0,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 2
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0,0],[1,-1,1,0,0,0],[0,1,-1,0,1,0],[0,0,1,0,0,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> 3
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0,0,0],[1,-1,1,0,0,0,0],[0,1,-1,1,0,0,0],[0,0,1,-1,1,0,0],[0,0,0,1,-1,1,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> 5
[7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0,0,0,0],[0,1,0,0,0,0,0,0],[0,0,1,0,0,0,0,0],[0,0,0,1,0,0,0,0],[0,0,0,0,1,0,0,0],[0,0,0,0,0,1,0,0],[0,0,0,0,0,0,0,1],[0,0,0,0,0,0,1,0]]
=> 0
[6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0,0,0],[0,1,0,0,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0]]
=> 0
[5,2]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> 1
[5,1,1]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> 0
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 0
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [[0,0,1,0,0],[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> 0
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 2
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 1
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 1
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [[0,0,0,1,0],[1,0,0,0,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> 1
[3,1,1,1,1]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [[0,1,0,0,0,0],[1,-1,0,1,0,0],[0,1,0,-1,1,0],[0,0,1,0,0,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> 3
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 2
[2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [[0,1,0,0,0,0],[1,-1,0,1,0,0],[0,1,0,0,0,0],[0,0,1,-1,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> 3
[2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0,0,0],[1,-1,1,0,0,0,0],[0,1,-1,1,0,0,0],[0,0,1,-1,0,1,0],[0,0,0,1,0,0,0],[0,0,0,0,1,-1,1],[0,0,0,0,0,1,0]]
=> 4
[1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0,0,0,0],[1,-1,1,0,0,0,0,0],[0,1,-1,1,0,0,0,0],[0,0,1,-1,1,0,0,0],[0,0,0,1,-1,1,0,0],[0,0,0,0,1,-1,1,0],[0,0,0,0,0,1,-1,1],[0,0,0,0,0,0,1,0]]
=> 6
Description
The number of entries equal to -1 in an alternating sign matrix.
The number of nonzero entries, [[St000890]] is twice this number plus the dimension of the matrix.
Matching statistic: St000214
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000214: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000214: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> [1] => 0
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 0
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [2,1] => 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => 0
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [3,1,2] => 0
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [3,2,1] => 2
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 0
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [2,1,3] => 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 3
[5]
=> [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] => 0
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => 0
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1,2,4] => 0
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [4,2,1,3] => 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => 2
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 4
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,2,3,4,5,6] => 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [6,1,2,3,4,5] => 0
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1,2,3,5] => 0
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [6,5,1,2,3,4] => 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [2,1,3,4] => 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,2,4] => 0
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [6,5,4,1,2,3] => 2
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [3,2,1,4] => 2
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => 2
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,2] => 3
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => 5
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,2,3,4,5,6,7] => 0
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [7,1,2,3,4,5,6] => 0
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [5,1,2,3,4,6] => 0
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> [7,6,1,2,3,4,5] => 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [3,1,2,4,5] => 0
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => 0
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [7,6,5,1,2,3,4] => 2
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,3,4] => 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [4,3,1,2,5] => 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [6,5,3,1,2,4] => 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,1,2,3] => 3
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => 2
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,1,3] => 3
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,3,1,2] => 4
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,3,2,1] => 6
Description
The number of adjacencies of a permutation.
An adjacency of a permutation $\pi$ is an index $i$ such that $\pi(i)-1 = \pi(i+1)$. Adjacencies are also known as ''small descents''.
This can be also described as an occurrence of the bivincular pattern ([2,1], {((0,1),(1,0),(1,1),(1,2),(2,1)}), i.e., the middle row and the middle column are shaded, see [3].
Matching statistic: St000359
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000359: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000359: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [1,1,0,0]
=> [2,1] => 0
[2]
=> [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 1
[1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => 0
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 2
[2,1]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 3
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 0
[1,1,1,1]
=> [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] => 0
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => 4
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 2
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 0
[2,1,1,1]
=> [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] => 0
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => 0
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,7,1] => 5
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [3,2,4,5,6,1] => 3
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,2,3,5,1] => 2
[4,1,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] => 2
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 2
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 0
[3,1,1,1]
=> [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
[2,2,2]
=> [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,2,1,1]
=> [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] => 0
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [3,2,1,4,5,6] => 0
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,5,7,6] => 0
[7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,7,8,1] => 6
[6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [3,2,4,5,6,7,1] => 4
[5,2]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [4,2,3,5,6,1] => 3
[5,1,1]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [2,4,3,5,6,1] => 3
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [5,2,3,4,1] => 2
[4,2,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,1,1,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] => 2
[3,3,1]
=> [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
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,2,3,1,5] => 1
[3,2,1,1]
=> [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] => 0
[3,1,1,1,1]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> [2,4,3,1,5,6] => 1
[2,2,2,1]
=> [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] => 0
[2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,4,3,2,5,6] => 0
[2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> [3,2,1,4,5,6,7] => 0
[1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,5,6,8,7] => 0
Description
The number of occurrences of the pattern 23-1.
See [[Permutations/#Pattern-avoiding_permutations]] for the definition of the pattern $23\!\!-\!\!1$.
Matching statistic: St000441
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000441: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000441: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> [1] => 0
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [2,1] => 0
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,2] => 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => 0
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => 0
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 2
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 0
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 3
[5]
=> [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] => 0
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => 0
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 0
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 2
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 4
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [6,5,4,3,2,1] => 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [5,4,3,2,1,6] => 0
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => 0
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [4,3,2,1,5,6] => 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [3,4,2,1] => 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => 0
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [3,2,1,4,5,6] => 2
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 2
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 2
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => 3
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => 5
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [7,6,5,4,3,2,1] => 0
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [6,5,4,3,2,1,7] => 0
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [5,4,3,2,6,1] => 0
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> [5,4,3,2,1,6,7] => 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,3,5,2,1] => 0
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [4,3,2,5,1,6] => 0
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [4,3,2,1,5,6,7] => 2
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [3,4,2,1,5] => 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [3,2,4,1,5,6] => 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> [3,2,1,4,5,6,7] => 3
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 2
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => 3
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6,7] => 4
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6,7] => 6
Description
The number of successions of a permutation.
A succession of a permutation $\pi$ is an index $i$ such that $\pi(i)+1 = \pi(i+1)$. Successions are also known as ''small ascents'' or ''1-rises''.
The following 307 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000877The depth of the binary word interpreted as a path. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St000011The number of touch points (or returns) of a Dyck path. St000160The multiplicity of the smallest part of a partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000392The length of the longest run of ones in a binary word. St000475The number of parts equal to 1 in a partition. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St001372The length of a longest cyclic run of ones of a binary word. St000013The height of a Dyck path. St000326The position of the first one in a binary word after appending a 1 at the end. St000932The number of occurrences of the pattern UDU in a Dyck path. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St001733The number of weak left to right maxima of a Dyck path. St000204The number of internal nodes of a binary tree. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St000028The number of stack-sorts needed to sort a permutation. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St000445The number of rises of length 1 of a Dyck path. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000711The number of big exceedences of a permutation. St000442The maximal area to the right of an up step of a Dyck path. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St000358The number of occurrences of the pattern 31-2. 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. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. 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. St000039The number of crossings of a permutation. St000317The cycle descent number of a permutation. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St000021The number of descents of a permutation. St000314The number of left-to-right-maxima of a permutation. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001498The normalised height of a Nakayama algebra with magnitude 1. St000325The width of the tree associated to a permutation. St000470The number of runs in a permutation. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St000444The length of the maximal rise of a Dyck path. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St000931The number of occurrences of the pattern UUU in a Dyck path. St000674The number of hills of a Dyck path. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St000074The number of special entries. St000654The first descent of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000996The number of exclusive left-to-right maxima of a permutation. St001480The number of simple summands of the module J^2/J^3. St000007The number of saliances of the permutation. St000054The first entry of the permutation. St000740The last entry of a permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St000365The number of double ascents of a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000989The number of final rises of a permutation. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001557The number of inversions of the second entry of a permutation. St001948The number of augmented double ascents of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000051The size of the left subtree of a binary tree. 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. St000338The number of pixed points of a permutation. St000461The rix statistic 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. St000710The number of big deficiencies of a permutation. St000990The first ascent of a permutation. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000061The number of nodes on the left branch 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. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000991The number of right-to-left minima of a permutation. 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. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St000025The number of initial rises of a Dyck path. St000738The first entry in the last row of a standard tableau. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000477The weight of a partition according to Alladi. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St000686The finitistic dominant dimension of a Dyck path. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001176The size of a partition minus its first part. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000010The length of the partition. St000012The area of a Dyck path. St000053The number of valleys of the Dyck path. St000148The number of odd parts of a partition. St000185The weighted size of a partition. St000228The size of a partition. St000295The length of the border of a binary word. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000377The dinv defect of an integer partition. St000384The maximal part of the shifted composition of an integer partition. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000459The hook length of the base cell of a partition. St000519The largest length of a factor maximising the subword complexity. St000548The number of different non-empty partial sums of an integer partition. St000784The maximum of the length and the largest part of the integer partition. St000867The sum of the hook lengths in the first row of an integer partition. St001127The sum of the squares of the parts of a partition. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. 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. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001961The sum of the greatest common divisors of all pairs of parts. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001438The number of missing boxes of a skew partition. St001868The number of alignments of type NE of a signed permutation. St001867The number of alignments of type EN of a signed permutation. St001816Eigenvalues of the top-to-random operator acting on a simple module. St000941The number of characters of the symmetric group whose value on the partition is even. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000478Another weight of a partition according to Alladi. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000567The sum of the products of all pairs of parts. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000681The Grundy value of Chomp on Ferrers diagrams. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000693The modular (standard) major index of a standard tableau. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000934The 2-degree of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000947The major index east count of a Dyck path. St000984The number of boxes below precisely one peak. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001139The number of occurrences of hills of size 2 in a Dyck path. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001435The number of missing boxes in the first row. St001487The number of inner corners of a skew partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001730The number of times the path corresponding to a binary word crosses the base line. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000899The maximal number of repetitions of an integer composition. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St001530The depth of a Dyck path. St001570The minimal number of edges to add to make a graph Hamiltonian. St000460The hook length of the last cell along the main diagonal of an integer partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001360The number of covering relations in Young's lattice below a partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001525The number of symmetric hooks on the diagonal of a partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001933The largest multiplicity of a part in an integer partition. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St000383The last part of an integer composition. St000406The number of occurrences of the pattern 3241 in a permutation. St000516The number of stretching pairs of a permutation. St000650The number of 3-rises of a permutation. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000873The aix statistic of a permutation. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001847The number of occurrences of the pattern 1432 in a permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St000120The number of left tunnels of a Dyck path. St000260The radius of a connected graph. St000456The monochromatic index of a connected graph. St000657The smallest part of an integer composition. St000942The number of critical left to right maxima of the parking functions. 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. St001864The number of excedances of a signed permutation. St001904The length of the initial strictly increasing segment of a parking function. St001905The number of preferred parking spots in a parking function less than the index of the car. St001937The size of the center of a parking function. St000259The diameter of a connected graph. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000815The number of semistandard Young tableaux of partition weight of given shape. St000929The constant term of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000454The largest eigenvalue of a graph if it is integral. St001651The Frankl number of a lattice. St001330The hat guessing number of a graph. St000993The multiplicity of the largest part of an integer partition. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000455The second largest eigenvalue of a graph if it is integral. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000284The Plancherel distribution on integer partitions. St000668The least common multiple of the parts of the partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000770The major index of an integer partition when read from bottom to top. St000901The cube of the number of standard Young tableaux with shape given by the partition. St001128The exponens consonantiae of a partition. St001556The number of inversions of the third entry of a permutation. St001645The pebbling number of a connected graph. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000706The product of the factorials of the multiplicities of an integer partition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St001060The distinguishing index of a graph. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001568The smallest positive integer that does not appear twice in the partition. St000352The Elizalde-Pak rank of a permutation. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St000091The descent variation of a composition. St000562The number of internal points of a set partition. St000589The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal, (2,3) are consecutive in a block. St000611The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal. St000709The number of occurrences of 14-2-3 or 14-3-2. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St000090The variation of a composition. St000492The rob statistic of a set partition. St000498The lcs statistic of a set partition. St000577The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000597The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, (2,3) are consecutive in a block. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St001151The number of blocks with odd minimum. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001722The number of minimal chains with small intervals between a binary word and the top element. St001896The number of right descents of a signed permutations. St001946The number of descents in a parking function. St000075The orbit size of a standard tableau under promotion. St000089The absolute variation of a composition. St000839The largest opener of a set partition. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St000230Sum of the minimal elements of the blocks of a set partition. St001375The pancake length of a permutation. St001516The number of cyclic bonds of a permutation. St000735The last entry on the main diagonal of a standard tableau.
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!