searching the database
Your data matches 68 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: St000018
(load all 20 compositions to match this statistic)
(load all 20 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000018: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000018: 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] => 1
[1,0,1,0,1,0]
=> [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => 1
[1,1,0,0,1,0]
=> [2,1,3] => 1
[1,1,0,1,0,0]
=> [2,3,1] => 2
[1,1,1,0,0,0]
=> [3,2,1] => 3
[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] => 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 4
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 4
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => 5
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 6
[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] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => 5
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 6
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 5
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 5
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => 6
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 7
Description
The number of inversions of a permutation.
This equals the minimal number of simple transpositions (i,i+1) needed to write π. Thus, it is also the Coxeter length of π.
Matching statistic: St000041
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00146: Dyck paths —to tunnel matching⟶ Perfect matchings
St000041: Perfect matchings ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000041: Perfect matchings ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [(1,2)]
=> 0
[1,0,1,0]
=> [(1,2),(3,4)]
=> 0
[1,1,0,0]
=> [(1,4),(2,3)]
=> 1
[1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6)]
=> 0
[1,0,1,1,0,0]
=> [(1,2),(3,6),(4,5)]
=> 1
[1,1,0,0,1,0]
=> [(1,4),(2,3),(5,6)]
=> 1
[1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 2
[1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 3
[1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,8),(6,7)]
=> 1
[1,0,1,1,0,0,1,0]
=> [(1,2),(3,6),(4,5),(7,8)]
=> 1
[1,0,1,1,0,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7)]
=> 2
[1,0,1,1,1,0,0,0]
=> [(1,2),(3,8),(4,7),(5,6)]
=> 3
[1,1,0,0,1,0,1,0]
=> [(1,4),(2,3),(5,6),(7,8)]
=> 1
[1,1,0,0,1,1,0,0]
=> [(1,4),(2,3),(5,8),(6,7)]
=> 2
[1,1,0,1,0,0,1,0]
=> [(1,6),(2,3),(4,5),(7,8)]
=> 2
[1,1,0,1,0,1,0,0]
=> [(1,8),(2,3),(4,5),(6,7)]
=> 3
[1,1,0,1,1,0,0,0]
=> [(1,8),(2,3),(4,7),(5,6)]
=> 4
[1,1,1,0,0,0,1,0]
=> [(1,6),(2,5),(3,4),(7,8)]
=> 3
[1,1,1,0,0,1,0,0]
=> [(1,8),(2,5),(3,4),(6,7)]
=> 4
[1,1,1,0,1,0,0,0]
=> [(1,8),(2,7),(3,4),(5,6)]
=> 5
[1,1,1,1,0,0,0,0]
=> [(1,8),(2,7),(3,6),(4,5)]
=> 6
[1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [(1,2),(3,4),(5,6),(7,10),(8,9)]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [(1,2),(3,4),(5,8),(6,7),(9,10)]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,10),(6,7),(8,9)]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [(1,2),(3,4),(5,10),(6,9),(7,8)]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [(1,2),(3,6),(4,5),(7,8),(9,10)]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [(1,2),(3,6),(4,5),(7,10),(8,9)]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [(1,2),(3,8),(4,5),(6,7),(9,10)]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,10),(4,5),(6,7),(8,9)]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [(1,2),(3,10),(4,5),(6,9),(7,8)]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [(1,2),(3,8),(4,7),(5,6),(9,10)]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [(1,2),(3,10),(4,7),(5,6),(8,9)]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [(1,2),(3,10),(4,9),(5,6),(7,8)]
=> 5
[1,0,1,1,1,1,0,0,0,0]
=> [(1,2),(3,10),(4,9),(5,8),(6,7)]
=> 6
[1,1,0,0,1,0,1,0,1,0]
=> [(1,4),(2,3),(5,6),(7,8),(9,10)]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [(1,4),(2,3),(5,6),(7,10),(8,9)]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [(1,4),(2,3),(5,8),(6,7),(9,10)]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [(1,4),(2,3),(5,10),(6,7),(8,9)]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [(1,4),(2,3),(5,10),(6,9),(7,8)]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [(1,6),(2,3),(4,5),(7,8),(9,10)]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [(1,6),(2,3),(4,5),(7,10),(8,9)]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [(1,8),(2,3),(4,5),(6,7),(9,10)]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [(1,10),(2,3),(4,5),(6,7),(8,9)]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [(1,10),(2,3),(4,5),(6,9),(7,8)]
=> 5
[1,1,0,1,1,0,0,0,1,0]
=> [(1,8),(2,3),(4,7),(5,6),(9,10)]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [(1,10),(2,3),(4,7),(5,6),(8,9)]
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> [(1,10),(2,3),(4,9),(5,6),(7,8)]
=> 6
[1,1,0,1,1,1,0,0,0,0]
=> [(1,10),(2,3),(4,9),(5,8),(6,7)]
=> 7
Description
The number of nestings of a perfect matching.
This is the number of pairs of edges ((a,b),(c,d)) such that a≤c≤d≤b. i.e., the edge (c,d) is nested inside (a,b).
Matching statistic: St000057
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
St000057: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000057: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1],[2]]
=> 0
[1,0,1,0]
=> [[1,3],[2,4]]
=> 0
[1,1,0,0]
=> [[1,2],[3,4]]
=> 1
[1,0,1,0,1,0]
=> [[1,3,5],[2,4,6]]
=> 0
[1,0,1,1,0,0]
=> [[1,3,4],[2,5,6]]
=> 1
[1,1,0,0,1,0]
=> [[1,2,5],[3,4,6]]
=> 1
[1,1,0,1,0,0]
=> [[1,2,4],[3,5,6]]
=> 2
[1,1,1,0,0,0]
=> [[1,2,3],[4,5,6]]
=> 3
[1,0,1,0,1,0,1,0]
=> [[1,3,5,7],[2,4,6,8]]
=> 0
[1,0,1,0,1,1,0,0]
=> [[1,3,5,6],[2,4,7,8]]
=> 1
[1,0,1,1,0,0,1,0]
=> [[1,3,4,7],[2,5,6,8]]
=> 1
[1,0,1,1,0,1,0,0]
=> [[1,3,4,6],[2,5,7,8]]
=> 2
[1,0,1,1,1,0,0,0]
=> [[1,3,4,5],[2,6,7,8]]
=> 3
[1,1,0,0,1,0,1,0]
=> [[1,2,5,7],[3,4,6,8]]
=> 1
[1,1,0,0,1,1,0,0]
=> [[1,2,5,6],[3,4,7,8]]
=> 2
[1,1,0,1,0,0,1,0]
=> [[1,2,4,7],[3,5,6,8]]
=> 2
[1,1,0,1,0,1,0,0]
=> [[1,2,4,6],[3,5,7,8]]
=> 3
[1,1,0,1,1,0,0,0]
=> [[1,2,4,5],[3,6,7,8]]
=> 4
[1,1,1,0,0,0,1,0]
=> [[1,2,3,7],[4,5,6,8]]
=> 3
[1,1,1,0,0,1,0,0]
=> [[1,2,3,6],[4,5,7,8]]
=> 4
[1,1,1,0,1,0,0,0]
=> [[1,2,3,5],[4,6,7,8]]
=> 5
[1,1,1,1,0,0,0,0]
=> [[1,2,3,4],[5,6,7,8]]
=> 6
[1,0,1,0,1,0,1,0,1,0]
=> [[1,3,5,7,9],[2,4,6,8,10]]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [[1,3,5,7,8],[2,4,6,9,10]]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [[1,3,5,6,9],[2,4,7,8,10]]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [[1,3,5,6,8],[2,4,7,9,10]]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [[1,3,5,6,7],[2,4,8,9,10]]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [[1,3,4,7,9],[2,5,6,8,10]]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [[1,3,4,7,8],[2,5,6,9,10]]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [[1,3,4,6,9],[2,5,7,8,10]]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [[1,3,4,6,8],[2,5,7,9,10]]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [[1,3,4,6,7],[2,5,8,9,10]]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [[1,3,4,5,9],[2,6,7,8,10]]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [[1,3,4,5,8],[2,6,7,9,10]]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [[1,3,4,5,7],[2,6,8,9,10]]
=> 5
[1,0,1,1,1,1,0,0,0,0]
=> [[1,3,4,5,6],[2,7,8,9,10]]
=> 6
[1,1,0,0,1,0,1,0,1,0]
=> [[1,2,5,7,9],[3,4,6,8,10]]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [[1,2,5,7,8],[3,4,6,9,10]]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [[1,2,5,6,9],[3,4,7,8,10]]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [[1,2,5,6,8],[3,4,7,9,10]]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [[1,2,5,6,7],[3,4,8,9,10]]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [[1,2,4,7,9],[3,5,6,8,10]]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [[1,2,4,7,8],[3,5,6,9,10]]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [[1,2,4,6,9],[3,5,7,8,10]]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [[1,2,4,6,8],[3,5,7,9,10]]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [[1,2,4,6,7],[3,5,8,9,10]]
=> 5
[1,1,0,1,1,0,0,0,1,0]
=> [[1,2,4,5,9],[3,6,7,8,10]]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [[1,2,4,5,8],[3,6,7,9,10]]
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> [[1,2,4,5,7],[3,6,8,9,10]]
=> 6
[1,1,0,1,1,1,0,0,0,0]
=> [[1,2,4,5,6],[3,7,8,9,10]]
=> 7
Description
The Shynar inversion number of a standard tableau.
Shynar's inversion number is the number of inversion pairs in a standard Young tableau, where an inversion pair is defined as a pair of integers (x,y) such that y > x and y appears strictly southwest of x in the tableau.
Matching statistic: St000067
(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
St000067: Alternating sign matrices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000067: 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]]
=> 1
[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]]
=> 1
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> 1
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> 2
[1,1,1,0,0,0]
=> [[0,0,1],[0,1,0],[1,0,0]]
=> 3
[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]]
=> 1
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> 1
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> 2
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]]
=> 3
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> 1
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> 2
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> 2
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> 3
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,0,1,0],[0,1,0,0]]
=> 4
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]]
=> 3
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[0,1,0,0],[1,0,-1,1],[0,0,1,0]]
=> 4
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[0,1,-1,1],[1,-1,1,0],[0,1,0,0]]
=> 5
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]
=> 6
[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]]
=> 1
[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]]
=> 1
[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]]
=> 2
[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]]
=> 3
[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]]
=> 1
[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]]
=> 2
[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]]
=> 2
[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]]
=> 3
[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]]
=> 4
[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]]
=> 3
[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]]
=> 4
[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]]
=> 5
[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]]
=> 6
[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]]
=> 1
[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]]
=> 2
[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]]
=> 2
[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]]
=> 3
[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]]
=> 4
[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]]
=> 2
[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]]
=> 3
[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]]
=> 3
[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]]
=> 4
[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]]
=> 5
[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]]
=> 4
[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]]
=> 5
[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]]
=> 6
[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]]
=> 7
Description
The inversion number of the alternating sign matrix.
If we denote the entries of the alternating sign matrix as ai,j, the inversion number is defined as
∑i>k∑j<ℓai,jak,ℓ.
When restricted to permutation matrices, this gives the usual inversion number of the permutation.
Matching statistic: St000076
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
St000076: Alternating sign matrices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000076: 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]]
=> 1
[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]]
=> 1
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> 1
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> 2
[1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> 3
[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]]
=> 1
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> 1
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> 2
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> 3
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> 1
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> 2
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> 2
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> 3
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> 4
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> 3
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> 4
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> 5
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> 6
[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]]
=> 1
[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]]
=> 1
[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]]
=> 2
[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]]
=> 3
[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]]
=> 1
[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]]
=> 2
[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]]
=> 2
[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]]
=> 3
[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,1,0,0],[0,0,0,1,0]]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 3
[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]]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 5
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> 6
[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]]
=> 1
[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]]
=> 2
[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]]
=> 2
[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]]
=> 3
[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,1,0,0],[0,0,0,1,0]]
=> 4
[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]]
=> 2
[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]]
=> 3
[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]]
=> 3
[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]]
=> 4
[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]]
=> 5
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> 4
[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]]
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> 6
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> 7
Description
The rank of the alternating sign matrix in the alternating sign matrix poset.
This rank is the sum of the entries of the monotone triangle minus \binom{n+2}{3}, which is the smallest sum of the entries in the set of all monotone triangles with bottom row 1\dots n.
Alternatively, rank(A)=\frac{1}{2} \sum_{i,j=1}^n (i-j)^2 a_{ij}, see [3, thm.5.1].
Matching statistic: St000161
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00029: Dyck paths —to binary tree: left tree, up step, right tree, down step⟶ Binary trees
St000161: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000161: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [.,.]
=> 0
[1,0,1,0]
=> [[.,.],.]
=> 0
[1,1,0,0]
=> [.,[.,.]]
=> 1
[1,0,1,0,1,0]
=> [[[.,.],.],.]
=> 0
[1,0,1,1,0,0]
=> [[.,.],[.,.]]
=> 1
[1,1,0,0,1,0]
=> [[.,[.,.]],.]
=> 1
[1,1,0,1,0,0]
=> [.,[[.,.],.]]
=> 2
[1,1,1,0,0,0]
=> [.,[.,[.,.]]]
=> 3
[1,0,1,0,1,0,1,0]
=> [[[[.,.],.],.],.]
=> 0
[1,0,1,0,1,1,0,0]
=> [[[.,.],.],[.,.]]
=> 1
[1,0,1,1,0,0,1,0]
=> [[[.,.],[.,.]],.]
=> 1
[1,0,1,1,0,1,0,0]
=> [[.,.],[[.,.],.]]
=> 2
[1,0,1,1,1,0,0,0]
=> [[.,.],[.,[.,.]]]
=> 3
[1,1,0,0,1,0,1,0]
=> [[[.,[.,.]],.],.]
=> 1
[1,1,0,0,1,1,0,0]
=> [[.,[.,.]],[.,.]]
=> 2
[1,1,0,1,0,0,1,0]
=> [[.,[[.,.],.]],.]
=> 2
[1,1,0,1,0,1,0,0]
=> [.,[[[.,.],.],.]]
=> 3
[1,1,0,1,1,0,0,0]
=> [.,[[.,.],[.,.]]]
=> 4
[1,1,1,0,0,0,1,0]
=> [[.,[.,[.,.]]],.]
=> 3
[1,1,1,0,0,1,0,0]
=> [.,[[.,[.,.]],.]]
=> 4
[1,1,1,0,1,0,0,0]
=> [.,[.,[[.,.],.]]]
=> 5
[1,1,1,1,0,0,0,0]
=> [.,[.,[.,[.,.]]]]
=> 6
[1,0,1,0,1,0,1,0,1,0]
=> [[[[[.,.],.],.],.],.]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [[[[.,.],.],.],[.,.]]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [[[[.,.],.],[.,.]],.]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [[[.,.],.],[[.,.],.]]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [[[.,.],.],[.,[.,.]]]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [[[[.,.],[.,.]],.],.]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [[[.,.],[.,.]],[.,.]]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [[[.,.],[[.,.],.]],.]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [[.,.],[[[.,.],.],.]]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [[.,.],[[.,.],[.,.]]]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [[[.,.],[.,[.,.]]],.]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [[.,.],[[.,[.,.]],.]]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [[.,.],[.,[[.,.],.]]]
=> 5
[1,0,1,1,1,1,0,0,0,0]
=> [[.,.],[.,[.,[.,.]]]]
=> 6
[1,1,0,0,1,0,1,0,1,0]
=> [[[[.,[.,.]],.],.],.]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [[[.,[.,.]],.],[.,.]]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [[[.,[.,.]],[.,.]],.]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [[.,[.,.]],[[.,.],.]]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [[.,[.,.]],[.,[.,.]]]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [[[.,[[.,.],.]],.],.]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [[.,[[.,.],.]],[.,.]]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [[.,[[[.,.],.],.]],.]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [.,[[[[.,.],.],.],.]]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [.,[[[.,.],.],[.,.]]]
=> 5
[1,1,0,1,1,0,0,0,1,0]
=> [[.,[[.,.],[.,.]]],.]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [.,[[[.,.],[.,.]],.]]
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> [.,[[.,.],[[.,.],.]]]
=> 6
[1,1,0,1,1,1,0,0,0,0]
=> [.,[[.,.],[.,[.,.]]]]
=> 7
Description
The sum of the sizes of the right subtrees of a binary tree.
This statistic corresponds to [[St000012]] under the Tamari Dyck path-binary tree bijection, and to [[St000018]] of the 312-avoiding permutation corresponding to the binary tree.
It is also the sum of all heights j of the coordinates (i,j) of the Dyck path corresponding to the binary tree.
Matching statistic: St000246
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000246: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000246: 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] => 1
[1,0,1,0,1,0]
=> [3,2,1] => 0
[1,0,1,1,0,0]
=> [2,3,1] => 1
[1,1,0,0,1,0]
=> [3,1,2] => 1
[1,1,0,1,0,0]
=> [2,1,3] => 2
[1,1,1,0,0,0]
=> [1,2,3] => 3
[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] => 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => 2
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 3
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 2
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => 2
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => 3
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => 4
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 3
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => 4
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => 5
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 6
[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] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => 2
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => 2
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => 3
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => 4
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => 5
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 6
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => 2
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => 5
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => 5
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => 6
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => 7
Description
The number of non-inversions of a permutation.
For a permutation of \{1,\ldots,n\}, this is given by \operatorname{noninv}(\pi) = \binom{n}{2}-\operatorname{inv}(\pi).
Matching statistic: St000391
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words
St000391: Binary words ⟶ ℤResult quality: 96% ●values known / values provided: 99%●distinct values known / distinct values provided: 96%
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words
St000391: Binary words ⟶ ℤResult quality: 96% ●values known / values provided: 99%●distinct values known / distinct values provided: 96%
Values
[1,0]
=> [1] => [1] => => ? = 0
[1,0,1,0]
=> [1,2] => [1,2] => 0 => 0
[1,1,0,0]
=> [2,1] => [2,1] => 1 => 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 00 => 0
[1,0,1,1,0,0]
=> [1,3,2] => [3,1,2] => 10 => 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 10 => 1
[1,1,0,1,0,0]
=> [2,3,1] => [2,3,1] => 01 => 2
[1,1,1,0,0,0]
=> [3,2,1] => [3,2,1] => 11 => 3
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 000 => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [4,1,2,3] => 100 => 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [3,1,2,4] => 100 => 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,4,1,2] => 010 => 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [4,3,1,2] => 110 => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 100 => 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,4,1,3] => 010 => 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [2,3,1,4] => 010 => 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [2,3,4,1] => 001 => 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [4,2,3,1] => 101 => 4
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,2,1,4] => 110 => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,2,4,1] => 101 => 4
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [3,4,2,1] => 011 => 5
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4,3,2,1] => 111 => 6
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0000 => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [5,1,2,3,4] => 1000 => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [4,1,2,3,5] => 1000 => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [4,5,1,2,3] => 0100 => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [5,4,1,2,3] => 1100 => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [3,1,2,4,5] => 1000 => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [3,5,1,2,4] => 0100 => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,4,1,2,5] => 0100 => 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [3,4,5,1,2] => 0010 => 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [5,3,4,1,2] => 1010 => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [4,3,1,2,5] => 1100 => 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [4,3,5,1,2] => 1010 => 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [4,5,3,1,2] => 0110 => 5
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [5,4,3,1,2] => 1110 => 6
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 1000 => 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,5,1,3,4] => 0100 => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,4,1,3,5] => 0100 => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,4,5,1,3] => 0010 => 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [5,2,4,1,3] => 1010 => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [2,3,1,4,5] => 0100 => 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [2,3,5,1,4] => 0010 => 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [2,3,4,1,5] => 0010 => 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => 0001 => 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [5,2,3,4,1] => 1001 => 5
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [4,2,3,1,5] => 1010 => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [4,2,3,5,1] => 1001 => 5
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [4,5,2,3,1] => 0101 => 6
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [5,4,2,3,1] => 1101 => 7
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [3,2,1,4,5] => 1100 => 3
[1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0]
=> [10,9,8,7,6,5,4,3,2,1,11] => [10,9,8,7,6,5,4,3,2,1,11] => 1111111110 => ? = 45
[1,0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0]
=> [1,11,10,9,8,7,6,5,4,3,2] => [11,10,9,8,7,6,5,4,3,1,2] => 1111111110 => ? = 45
Description
The sum of the positions of the ones in a binary word.
Matching statistic: St000330
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000330: Standard tableaux ⟶ ℤResult quality: 92% ●values known / values provided: 97%●distinct values known / distinct values provided: 92%
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000330: Standard tableaux ⟶ ℤResult quality: 92% ●values known / values provided: 97%●distinct values known / distinct values provided: 92%
Values
[1,0]
=> [1] => [1] => [[1]]
=> 0
[1,0,1,0]
=> [1,2] => [1,2] => [[1,2]]
=> 0
[1,1,0,0]
=> [2,1] => [2,1] => [[1],[2]]
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [[1,2,3]]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [3,1,2] => [[1,3],[2]]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => [[1,3],[2]]
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [2,3,1] => [[1,2],[3]]
=> 2
[1,1,1,0,0,0]
=> [3,2,1] => [3,2,1] => [[1],[2],[3]]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [[1,2,3,4]]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [4,1,2,3] => [[1,3,4],[2]]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [3,1,2,4] => [[1,3,4],[2]]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,4,1,2] => [[1,2],[3,4]]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [4,3,1,2] => [[1,4],[2],[3]]
=> 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => [[1,3,4],[2]]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,4,1,3] => [[1,2],[3,4]]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [2,3,1,4] => [[1,2,4],[3]]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [2,3,4,1] => [[1,2,3],[4]]
=> 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [4,2,3,1] => [[1,3],[2],[4]]
=> 4
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,2,1,4] => [[1,4],[2],[3]]
=> 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,2,4,1] => [[1,3],[2],[4]]
=> 4
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [3,4,2,1] => [[1,2],[3],[4]]
=> 5
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4,3,2,1] => [[1],[2],[3],[4]]
=> 6
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [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] => [5,1,2,3,4] => [[1,3,4,5],[2]]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [4,1,2,3,5] => [[1,3,4,5],[2]]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [4,5,1,2,3] => [[1,2,5],[3,4]]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [5,4,1,2,3] => [[1,4,5],[2],[3]]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [3,1,2,4,5] => [[1,3,4,5],[2]]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [3,5,1,2,4] => [[1,2,5],[3,4]]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,4,1,2,5] => [[1,2,5],[3,4]]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [3,4,5,1,2] => [[1,2,3],[4,5]]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [5,3,4,1,2] => [[1,3],[2,5],[4]]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [4,3,1,2,5] => [[1,4,5],[2],[3]]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [4,3,5,1,2] => [[1,3],[2,5],[4]]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [4,5,3,1,2] => [[1,2],[3,5],[4]]
=> 5
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [5,4,3,1,2] => [[1,5],[2],[3],[4]]
=> 6
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [[1,3,4,5],[2]]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,5,1,3,4] => [[1,2,5],[3,4]]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,4,1,3,5] => [[1,2,5],[3,4]]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,4,5,1,3] => [[1,2,3],[4,5]]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [5,2,4,1,3] => [[1,3],[2,5],[4]]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [2,3,1,4,5] => [[1,2,4,5],[3]]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [2,3,5,1,4] => [[1,2,3],[4,5]]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [2,3,4,1,5] => [[1,2,3,5],[4]]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => [[1,2,3,4],[5]]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [5,2,3,4,1] => [[1,3,4],[2],[5]]
=> 5
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [4,2,3,1,5] => [[1,3,5],[2],[4]]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [4,2,3,5,1] => [[1,3,4],[2],[5]]
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [4,5,2,3,1] => [[1,2],[3,4],[5]]
=> 6
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [5,4,2,3,1] => [[1,4],[2],[3],[5]]
=> 7
[1,0,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0]
=> [1,8,9,7,6,5,4,3,2] => [8,9,7,6,5,4,3,1,2] => [[1,2],[3,9],[4],[5],[6],[7],[8]]
=> ? = 27
[1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0]
=> [10,9,8,7,6,5,4,3,2,1,11] => [10,9,8,7,6,5,4,3,2,1,11] => [[1,11],[2],[3],[4],[5],[6],[7],[8],[9],[10]]
=> ? = 45
[1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,1,0]
=> [7,6,8,5,4,3,2,1,9] => [7,6,8,5,4,3,2,1,9] => [[1,3,9],[2],[4],[5],[6],[7],[8]]
=> ? = 26
[1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,1,0]
=> [6,8,7,5,4,3,2,1,9] => [8,6,7,5,4,3,2,1,9] => [[1,3,9],[2],[4],[5],[6],[7],[8]]
=> ? = 26
[1,0,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0]
=> [1,8,7,9,6,5,4,3,2] => [8,7,9,6,5,4,3,1,2] => [[1,3],[2,9],[4],[5],[6],[7],[8]]
=> ? = 26
[1,0,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0]
=> [1,7,9,8,6,5,4,3,2] => [9,7,8,6,5,4,3,1,2] => [[1,3],[2,9],[4],[5],[6],[7],[8]]
=> ? = 26
[1,0,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0]
=> [1,9,10,8,7,6,5,4,3,2] => [9,10,8,7,6,5,4,3,1,2] => [[1,2],[3,10],[4],[5],[6],[7],[8],[9]]
=> ? = 35
[1,0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0]
=> [1,11,10,9,8,7,6,5,4,3,2] => [11,10,9,8,7,6,5,4,3,1,2] => [[1,11],[2],[3],[4],[5],[6],[7],[8],[9],[10]]
=> ? = 45
Description
The (standard) major index of a standard tableau.
A descent of a standard tableau T is an index i such that i+1 appears in a row strictly below the row of i. The (standard) major index is the the sum of the descents.
Matching statistic: St000008
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
Mp00071: Permutations —descent composition⟶ Integer compositions
St000008: Integer compositions ⟶ ℤResult quality: 81% ●values known / values provided: 95%●distinct values known / distinct values provided: 81%
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
Mp00071: Permutations —descent composition⟶ Integer compositions
St000008: Integer compositions ⟶ ℤResult quality: 81% ●values known / values provided: 95%●distinct values known / distinct values provided: 81%
Values
[1,0]
=> [1] => [1] => [1] => 0
[1,0,1,0]
=> [1,2] => [1,2] => [2] => 0
[1,1,0,0]
=> [2,1] => [2,1] => [1,1] => 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => [3,1,2] => [1,2] => 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => [1,2] => 1
[1,1,0,1,0,0]
=> [2,3,1] => [2,3,1] => [2,1] => 2
[1,1,1,0,0,0]
=> [3,2,1] => [3,2,1] => [1,1,1] => 3
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [4,1,2,3] => [1,3] => 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [3,1,2,4] => [1,3] => 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,4,1,2] => [2,2] => 2
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [4,3,1,2] => [1,1,2] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => [1,3] => 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,4,1,3] => [2,2] => 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [2,3,1,4] => [2,2] => 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [2,3,4,1] => [3,1] => 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [4,2,3,1] => [1,2,1] => 4
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,2,1,4] => [1,1,2] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,2,4,1] => [1,2,1] => 4
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [3,4,2,1] => [2,1,1] => 5
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4,3,2,1] => [1,1,1,1] => 6
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [5,1,2,3,4] => [1,4] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [4,1,2,3,5] => [1,4] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [4,5,1,2,3] => [2,3] => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [5,4,1,2,3] => [1,1,3] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [3,1,2,4,5] => [1,4] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [3,5,1,2,4] => [2,3] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,4,1,2,5] => [2,3] => 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [3,4,5,1,2] => [3,2] => 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [5,3,4,1,2] => [1,2,2] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [4,3,1,2,5] => [1,1,3] => 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [4,3,5,1,2] => [1,2,2] => 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [4,5,3,1,2] => [2,1,2] => 5
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [5,4,3,1,2] => [1,1,1,2] => 6
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [1,4] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,5,1,3,4] => [2,3] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,4,1,3,5] => [2,3] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,4,5,1,3] => [3,2] => 3
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [5,2,4,1,3] => [1,2,2] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [2,3,1,4,5] => [2,3] => 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [2,3,5,1,4] => [3,2] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [2,3,4,1,5] => [3,2] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => [4,1] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [5,2,3,4,1] => [1,3,1] => 5
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [4,2,3,1,5] => [1,2,2] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [4,2,3,5,1] => [1,3,1] => 5
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [4,5,2,3,1] => [2,2,1] => 6
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [5,4,2,3,1] => [1,1,2,1] => 7
[1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [8,7,6,5,4,3,2,1,9] => [8,7,6,5,4,3,2,1,9] => [1,1,1,1,1,1,1,2] => ? = 28
[1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,9,8,7,6,5,4,3,2] => [9,8,7,6,5,4,3,1,2] => [1,1,1,1,1,1,1,2] => ? = 28
[1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
=> [9,8,7,6,5,4,3,2,1,10] => [9,8,7,6,5,4,3,2,1,10] => [1,1,1,1,1,1,1,1,2] => ? = 36
[1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,1,0]
=> [7,8,6,5,4,3,2,1,9] => [7,8,6,5,4,3,2,1,9] => [2,1,1,1,1,1,2] => ? = 27
[1,0,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0]
=> [1,8,9,7,6,5,4,3,2] => [8,9,7,6,5,4,3,1,2] => [2,1,1,1,1,1,2] => ? = 27
[1,0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0]
=> [1,10,9,8,7,6,5,4,3,2] => [10,9,8,7,6,5,4,3,1,2] => [1,1,1,1,1,1,1,1,2] => ? = 36
[1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0]
=> [10,9,8,7,6,5,4,3,2,1,11] => [10,9,8,7,6,5,4,3,2,1,11] => [1,1,1,1,1,1,1,1,1,2] => ? = 45
[1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,1,0]
=> [7,6,8,5,4,3,2,1,9] => [7,6,8,5,4,3,2,1,9] => [1,2,1,1,1,1,2] => ? = 26
[1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,1,0]
=> [6,8,7,5,4,3,2,1,9] => [8,6,7,5,4,3,2,1,9] => [1,2,1,1,1,1,2] => ? = 26
[1,0,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0]
=> [1,8,7,9,6,5,4,3,2] => [8,7,9,6,5,4,3,1,2] => [1,2,1,1,1,1,2] => ? = 26
[1,0,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0]
=> [1,7,9,8,6,5,4,3,2] => [9,7,8,6,5,4,3,1,2] => [1,2,1,1,1,1,2] => ? = 26
[1,0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0]
=> [1,11,10,9,8,7,6,5,4,3,2] => [11,10,9,8,7,6,5,4,3,1,2] => [1,1,1,1,1,1,1,1,1,2] => ? = 45
Description
The major index of the composition.
The descents of a composition [c_1,c_2,\dots,c_k] are the partial sums c_1, c_1+c_2,\dots, c_1+\dots+c_{k-1}, excluding the sum of all parts. The major index of a composition is the sum of its descents.
For details about the major index see [[Permutations/Descents-Major]].
The following 58 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000012The area of a Dyck path. St001161The major index north count of a Dyck path. St000947The major index east count of a Dyck path. St000378The diagonal inversion number of an integer partition. St000492The rob statistic of a set partition. St000499The rcb statistic of a set partition. St000579The number of occurrences of the pattern {{1},{2}} such that 2 is a maximal element. St001397Number of pairs of incomparable elements in a finite poset. St000081The number of edges of a graph. St000010The length of the partition. St000332The positive inversions of an alternating sign matrix. St001671Haglund's hag of a permutation. St000795The mad of a permutation. St000006The dinv of a Dyck path. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St000005The bounce statistic of a Dyck path. St000004The major index of a permutation. St000042The number of crossings of a perfect matching. St000233The number of nestings of a set partition. St000496The rcs statistic of a set partition. St001428The number of B-inversions of a signed permutation. St000156The Denert index of a permutation. St000305The inverse major index of a permutation. St000796The stat' of a permutation. St000798The makl of a permutation. St000833The comajor index of a permutation. St000448The number of pairs of vertices of a graph with distance 2. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001311The cyclomatic number of a graph. St000803The number of occurrences of the vincular pattern |132 in a permutation. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001718The number of non-empty open intervals in a poset. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000080The rank of the poset. St000528The height of a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001782The order of rowmotion on the set of order ideals of a poset. St000906The length of the shortest maximal chain in a poset. St000643The size of the largest orbit of antichains under Panyushev complementation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St000450The number of edges minus the number of vertices plus 2 of a graph. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St001862The number of crossings of a signed permutation. St000232The number of crossings of a set partition. St000359The number of occurrences of the pattern 23-1. St001866The nesting alignments of a signed permutation. St000136The dinv of a parking function. St000194The number of primary dinversion pairs of a labelled dyck path corresponding to a parking function. St001433The flag major index of a signed permutation. St001822The number of alignments of a signed permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order.
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!