searching the database
Your data matches 71 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: St000065
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Mp00137: Dyck paths —to symmetric ASM⟶ Alternating sign matrices
St000065: Alternating sign matrices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000065: Alternating sign matrices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> 0
[1,0,1,0]
=> [[1,0],[0,1]]
=> 0
[1,1,0,0]
=> [[0,1],[1,0]]
=> 0
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> 0
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> 0
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> 0
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> 1
[1,1,1,0,0,0]
=> [[0,0,1],[0,1,0],[1,0,0]]
=> 0
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[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
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> 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
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]]
=> 0
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,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
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> 1
[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
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,0,1,0],[0,1,0,0]]
=> 1
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]]
=> 0
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[0,1,0,0],[1,0,-1,1],[0,0,1,0]]
=> 1
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[0,1,-1,1],[1,-1,1,0],[0,1,0,0]]
=> 2
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[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
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 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
[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,0,1,0],[0,0,1,0,0]]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,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
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 1
[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
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,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
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 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
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> 1
[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
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 2
[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
[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,0,1,0],[0,0,1,0,0]]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> 1
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: St000355
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000355: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000355: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 0
[1,0,1,0]
=> [2,1] => 0
[1,1,0,0]
=> [1,2] => 0
[1,0,1,0,1,0]
=> [3,2,1] => 0
[1,0,1,1,0,0]
=> [2,3,1] => 0
[1,1,0,0,1,0]
=> [3,1,2] => 0
[1,1,0,1,0,0]
=> [2,1,3] => 1
[1,1,1,0,0,0]
=> [1,2,3] => 0
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 0
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => 0
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 0
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 0
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 0
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => 1
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => 2
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 0
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => 1
Description
The number of occurrences of the pattern 21-3.
See [[Permutations/#Pattern-avoiding_permutations]] for the definition of the pattern $21\!\!-\!\!3$.
Matching statistic: St000359
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000359: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000359: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 0
[1,0,1,0]
=> [1,2] => 0
[1,1,0,0]
=> [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => 0
[1,1,0,0,1,0]
=> [2,1,3] => 0
[1,1,0,1,0,0]
=> [2,3,1] => 1
[1,1,1,0,0,0]
=> [3,2,1] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 0
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 1
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: St001033
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001033: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001033: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [1,1,0,0]
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 0
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 0
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
Description
The normalized area of the parallelogram polyomino associated with the Dyck path.
The area of the smallest parallelogram polyomino equals the semilength of the Dyck path. This statistic is therefore the area of the parallelogram polyomino minus the semilength of the Dyck path.
The area itself is equidistributed with [[St001034]] and with [[St000395]].
Matching statistic: St001843
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St001843: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001843: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> {{1}}
=> 0
[1,0,1,0]
=> {{1},{2}}
=> 0
[1,1,0,0]
=> {{1,2}}
=> 0
[1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 0
[1,0,1,1,0,0]
=> {{1},{2,3}}
=> 0
[1,1,0,0,1,0]
=> {{1,2},{3}}
=> 0
[1,1,0,1,0,0]
=> {{1,3},{2}}
=> 1
[1,1,1,0,0,0]
=> {{1,2,3}}
=> 0
[1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 0
[1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 0
[1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> 1
[1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 0
[1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 0
[1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 0
[1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> 1
[1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 2
[1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 1
[1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 0
[1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 1
[1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 2
[1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4},{5}}
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3,5},{4}}
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> {{1},{2,4},{3},{5}}
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> {{1},{2,5},{3},{4}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> {{1},{2,3,5},{4}}
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> {{1,2},{3},{4},{5}}
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> {{1,2},{3,5},{4}}
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> {{1,3},{2},{4},{5}}
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> {{1,3},{2},{4,5}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> {{1,4},{2},{3},{5}}
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> {{1,5},{2},{3},{4}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> {{1,3,4},{2},{5}}
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> 1
Description
The Z-index of a set partition.
The Mahonian representation of a set partition $\{B_1,\dots,B_k\}$ of $\{1,\dots,n\}$ is the restricted growth word $w_1\dots w_n$ obtained by sorting the blocks of the set partition according to their maximal element, and setting $w_i$ to the index of the block containing $i$.
The Z-index of $w$ equals
$$
\sum_{i < j} w_{i,j},
$$
where $w_{i,j}$ is the word obtained from $w$ by removing all letters different from $i$ and $j$.
Matching statistic: St000223
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00239: Permutations —Corteel⟶ Permutations
St000223: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00239: Permutations —Corteel⟶ Permutations
St000223: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [1,2] => [1,2] => 0
[1,1,0,0]
=> [2,1] => [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => 0
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 0
[1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => 1
[1,1,1,0,0,0]
=> [3,1,2] => [3,1,2] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [1,4,2,3] => 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,2,3,1] => 2
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [4,2,1,3] => 1
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [3,1,2,4] => 0
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [4,1,3,2] => 1
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [4,3,2,1] => 2
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [4,1,2,3] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [1,2,5,3,4] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [1,5,3,2,4] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [1,4,2,3,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [1,5,2,4,3] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [1,5,4,3,2] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [1,5,2,3,4] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [2,1,5,3,4] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [5,2,3,1,4] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [4,2,1,3,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [5,2,1,4,3] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [5,2,4,3,1] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [5,2,1,3,4] => 1
Description
The number of nestings in the permutation.
Matching statistic: St000358
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
St000358: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
St000358: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [2,1] => [2,1] => 0
[1,1,0,0]
=> [1,2] => [1,2] => 0
[1,0,1,0,1,0]
=> [2,3,1] => [3,2,1] => 0
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => 0
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => 0
[1,1,0,1,0,0]
=> [3,1,2] => [3,1,2] => 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,3,2,1] => 0
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,2,1,4] => 0
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => 0
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [4,2,1,3] => 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => 0
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,3,2] => 0
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => 0
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [4,3,1,2] => 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [4,1,3,2] => 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,1,2,4] => 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => 0
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,2,3] => 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [4,1,2,3] => 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [5,4,3,2,1] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,3,2,1,5] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [5,3,2,1,4] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [5,4,2,1,3] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [5,2,1,4,3] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [4,2,1,3,5] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,5,3,4] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [5,2,1,3,4] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,4,3,2] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,5,3,2,4] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [5,4,3,1,2] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [4,3,1,2,5] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [5,4,1,3,2] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [5,1,4,3,2] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [4,1,3,2,5] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [3,1,2,5,4] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [5,3,1,2,4] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [5,1,3,2,4] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [3,1,2,4,5] => 1
Description
The number of occurrences of the pattern 31-2.
See [[Permutations/#Pattern-avoiding_permutations]] for the definition of the pattern $31\!\!-\!\!2$.
Matching statistic: St000496
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
Mp00112: Set partitions —complement⟶ Set partitions
St000496: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00112: Set partitions —complement⟶ Set partitions
St000496: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> {{1}}
=> {{1}}
=> 0
[1,0,1,0]
=> {{1},{2}}
=> {{1},{2}}
=> 0
[1,1,0,0]
=> {{1,2}}
=> {{1,2}}
=> 0
[1,0,1,0,1,0]
=> {{1},{2},{3}}
=> {{1},{2},{3}}
=> 0
[1,0,1,1,0,0]
=> {{1},{2,3}}
=> {{1,2},{3}}
=> 0
[1,1,0,0,1,0]
=> {{1,2},{3}}
=> {{1},{2,3}}
=> 0
[1,1,0,1,0,0]
=> {{1,3},{2}}
=> {{1,3},{2}}
=> 1
[1,1,1,0,0,0]
=> {{1,2,3}}
=> {{1,2,3}}
=> 0
[1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> {{1,2},{3},{4}}
=> 0
[1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> {{1},{2,3},{4}}
=> 0
[1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> {{1,3},{2},{4}}
=> 1
[1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> {{1,2,3},{4}}
=> 0
[1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> {{1},{2},{3,4}}
=> 0
[1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> {{1,2},{3,4}}
=> 0
[1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> {{1},{2,4},{3}}
=> 1
[1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> {{1,4},{2},{3}}
=> 2
[1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> {{1,2,4},{3}}
=> 1
[1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> {{1},{2,3,4}}
=> 0
[1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> {{1,4},{2,3}}
=> 1
[1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> {{1,3,4},{2}}
=> 2
[1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> {{1,2,3,4}}
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4},{5}}
=> {{1},{2},{3},{4},{5}}
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> {{1,2},{3},{4},{5}}
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> {{1},{2,3},{4},{5}}
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3,5},{4}}
=> {{1,3},{2},{4},{5}}
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> {{1,2,3},{4},{5}}
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> {{1},{2},{3,4},{5}}
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> {{1,2},{3,4},{5}}
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> {{1},{2,4},{3},{5}}
=> {{1},{2,4},{3},{5}}
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> {{1},{2,5},{3},{4}}
=> {{1,4},{2},{3},{5}}
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> {{1,2,4},{3},{5}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> {{1},{2,3,4},{5}}
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> {{1,4},{2,3},{5}}
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> {{1},{2,3,5},{4}}
=> {{1,3,4},{2},{5}}
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> {{1,2,3,4},{5}}
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> {{1,2},{3},{4},{5}}
=> {{1},{2},{3},{4,5}}
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> {{1,2},{3},{4,5}}
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> {{1},{2,3},{4,5}}
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> {{1,2},{3,5},{4}}
=> {{1,3},{2},{4,5}}
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> {{1,2,3},{4,5}}
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> {{1,3},{2},{4},{5}}
=> {{1},{2},{3,5},{4}}
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> {{1,3},{2},{4,5}}
=> {{1,2},{3,5},{4}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> {{1,4},{2},{3},{5}}
=> {{1},{2,5},{3},{4}}
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> {{1,5},{2},{3},{4}}
=> {{1,5},{2},{3},{4}}
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> {{1,2,5},{3},{4}}
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> {{1,3,4},{2},{5}}
=> {{1},{2,3,5},{4}}
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> {{1,5},{2,3},{4}}
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> {{1,3,5},{2},{4}}
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> {{1,2,3,5},{4}}
=> 1
Description
The rcs statistic of a set partition.
Let $S = B_1,\ldots,B_k$ be a set partition with ordered blocks $B_i$ and with $\operatorname{min} B_a < \operatorname{min} B_b$ for $a < b$.
According to [1, Definition 3], a '''rcs''' (right-closer-smaller) of $S$ is given by a pair $i > j$ such that $j = \operatorname{max} B_b$ and $i \in B_a$ for $a < b$.
Matching statistic: St001083
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00069: Permutations —complement⟶ Permutations
St001083: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00069: Permutations —complement⟶ Permutations
St001083: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [2,1] => [1,2] => 0
[1,1,0,0]
=> [1,2] => [2,1] => 0
[1,0,1,0,1,0]
=> [2,3,1] => [2,1,3] => 0
[1,0,1,1,0,0]
=> [2,1,3] => [2,3,1] => 0
[1,1,0,0,1,0]
=> [1,3,2] => [3,1,2] => 0
[1,1,0,1,0,0]
=> [3,1,2] => [1,3,2] => 1
[1,1,1,0,0,0]
=> [1,2,3] => [3,2,1] => 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [3,2,1,4] => 0
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,2,4,1] => 0
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [3,4,1,2] => 0
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [3,1,4,2] => 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [3,4,2,1] => 0
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [4,2,1,3] => 0
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [4,2,3,1] => 0
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [2,4,1,3] => 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [2,1,4,3] => 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [2,4,3,1] => 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [4,3,1,2] => 0
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [4,1,3,2] => 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,4,3,2] => 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [4,3,2,1,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,3,2,5,1] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [4,3,5,1,2] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [4,3,1,5,2] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [4,3,5,2,1] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [4,5,2,1,3] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [4,5,2,3,1] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [4,2,5,1,3] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [4,2,1,5,3] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [4,2,5,3,1] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [4,5,3,1,2] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [4,5,1,3,2] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [4,1,5,3,2] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [4,5,3,2,1] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [5,3,2,1,4] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [5,3,2,4,1] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [5,3,4,1,2] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [5,3,1,4,2] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [5,3,4,2,1] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [3,5,2,1,4] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [3,5,2,4,1] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [3,2,5,1,4] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [3,2,1,5,4] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [3,2,5,4,1] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [3,5,4,1,2] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [3,5,1,4,2] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [3,1,5,4,2] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [3,5,4,2,1] => 1
Description
The number of boxed occurrences of 132 in a permutation.
This is the number of occurrences of the pattern $132$ such that any entry between the three matched entries is either larger than the largest matched entry or smaller than the smallest matched entry.
Matching statistic: St001727
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St001727: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St001727: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => 0
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => 0
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 0
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => 0
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => 0
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 0
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 0
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 0
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 0
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 0
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,3,4,2,1] => 3
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2,5,4,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [5,3,2,4,1] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 1
Description
The number of invisible inversions of a permutation.
A visible inversion of a permutation $\pi$ is a pair $i < j$ such that $\pi(j) \leq \min(i, \pi(i))$. Thus, an invisible inversion satisfies $\pi(i) > \pi(j) > i$.
The following 61 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000356The number of occurrences of the pattern 13-2. St001176The size of a partition minus its first part. St001377The major index minus the number of inversions of a permutation. St001841The number of inversions of a set partition. St000039The number of crossings of a permutation. St000491The number of inversions of a set partition. St000572The dimension exponent of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000497The lcb statistic of a set partition. St000609The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal. St001311The cyclomatic number of a graph. St000456The monochromatic index of a connected graph. St001271The competition number of a graph. St001214The aft of an integer partition. St001596The number of two-by-two squares inside a skew partition. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St000362The size of a minimal vertex cover of a graph. St000387The matching number of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001305The number of induced cycles on four vertices in a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001971The number of negative eigenvalues of the adjacency matrix of the graph. St001725The harmonious chromatic number of a graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St001117The game chromatic index of a graph. St001574The minimal number of edges to add or remove to make a graph regular. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001742The difference of the maximal and the minimal degree in a graph. St001812The biclique partition number of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St000463The number of admissible inversions of a permutation. St001624The breadth of a lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001980The Castelnuovo-Mumford regularity of an alternating sign matrix. St001330The hat guessing number of a graph. St000441The number of successions of a permutation. St000665The number of rafts of a permutation. St000731The number of double exceedences of a permutation. St000028The number of stack-sorts needed to sort a permutation. St000451The length of the longest pattern of the form k 1 2. St001811The Castelnuovo-Mumford regularity of a permutation. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St000058The order of a permutation. St001862The number of crossings of a signed permutation. St001438The number of missing boxes of a skew partition. St001866The nesting alignments of a signed permutation. St001867The number of alignments of type EN of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001864The number of excedances of a signed permutation. St001115The number of even descents of a permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St000074The number of special entries. St000516The number of stretching pairs of a permutation. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001394The genus of a permutation. St000352The Elizalde-Pak rank of a permutation.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!