searching the database
Your data matches 195 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: St000377
St000377: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 0 = 1 - 1
[2]
=> 0 = 1 - 1
[1,1]
=> 1 = 2 - 1
[3]
=> 1 = 2 - 1
[2,1]
=> 0 = 1 - 1
[1,1,1]
=> 2 = 3 - 1
[4]
=> 2 = 3 - 1
[3,1]
=> 0 = 1 - 1
[2,2]
=> 1 = 2 - 1
[2,1,1]
=> 2 = 3 - 1
[1,1,1,1]
=> 3 = 4 - 1
[5]
=> 3 = 4 - 1
[4,1]
=> 2 = 3 - 1
[3,2]
=> 0 = 1 - 1
[3,1,1]
=> 1 = 2 - 1
[2,2,1]
=> 2 = 3 - 1
[2,1,1,1]
=> 3 = 4 - 1
[1,1,1,1,1]
=> 4 = 5 - 1
[6]
=> 4 = 5 - 1
[5,1]
=> 3 = 4 - 1
[4,2]
=> 1 = 2 - 1
[4,1,1]
=> 2 = 3 - 1
[3,3]
=> 2 = 3 - 1
[3,2,1]
=> 0 = 1 - 1
[3,1,1,1]
=> 3 = 4 - 1
[2,2,2]
=> 3 = 4 - 1
[2,2,1,1]
=> 4 = 5 - 1
[2,1,1,1,1]
=> 4 = 5 - 1
[1,1,1,1,1,1]
=> 5 = 6 - 1
[7]
=> 5 = 6 - 1
[6,1]
=> 4 = 5 - 1
[5,2]
=> 3 = 4 - 1
[5,1,1]
=> 4 = 5 - 1
[4,3]
=> 2 = 3 - 1
[4,2,1]
=> 0 = 1 - 1
[4,1,1,1]
=> 3 = 4 - 1
[3,3,1]
=> 1 = 2 - 1
[3,2,2]
=> 2 = 3 - 1
[3,2,1,1]
=> 3 = 4 - 1
[3,1,1,1,1]
=> 4 = 5 - 1
[2,2,2,1]
=> 4 = 5 - 1
[2,2,1,1,1]
=> 5 = 6 - 1
[2,1,1,1,1,1]
=> 5 = 6 - 1
[1,1,1,1,1,1,1]
=> 6 = 7 - 1
[8]
=> 6 = 7 - 1
[7,1]
=> 5 = 6 - 1
[6,2]
=> 4 = 5 - 1
[6,1,1]
=> 5 = 6 - 1
[5,3]
=> 3 = 4 - 1
[5,2,1]
=> 3 = 4 - 1
Description
The dinv defect of an integer partition.
This is the number of cells $c$ in the diagram of an integer partition $\lambda$ for which $\operatorname{arm}(c)-\operatorname{leg}(c) \not\in \{0,1\}$.
Matching statistic: St001176
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
St001176: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 0 = 1 - 1
[2]
=> 0 = 1 - 1
[1,1]
=> 1 = 2 - 1
[3]
=> 0 = 1 - 1
[2,1]
=> 1 = 2 - 1
[1,1,1]
=> 2 = 3 - 1
[4]
=> 0 = 1 - 1
[3,1]
=> 1 = 2 - 1
[2,2]
=> 2 = 3 - 1
[2,1,1]
=> 2 = 3 - 1
[1,1,1,1]
=> 3 = 4 - 1
[5]
=> 0 = 1 - 1
[4,1]
=> 1 = 2 - 1
[3,2]
=> 2 = 3 - 1
[3,1,1]
=> 2 = 3 - 1
[2,2,1]
=> 3 = 4 - 1
[2,1,1,1]
=> 3 = 4 - 1
[1,1,1,1,1]
=> 4 = 5 - 1
[6]
=> 0 = 1 - 1
[5,1]
=> 1 = 2 - 1
[4,2]
=> 2 = 3 - 1
[4,1,1]
=> 2 = 3 - 1
[3,3]
=> 3 = 4 - 1
[3,2,1]
=> 3 = 4 - 1
[3,1,1,1]
=> 3 = 4 - 1
[2,2,2]
=> 4 = 5 - 1
[2,2,1,1]
=> 4 = 5 - 1
[2,1,1,1,1]
=> 4 = 5 - 1
[1,1,1,1,1,1]
=> 5 = 6 - 1
[7]
=> 0 = 1 - 1
[6,1]
=> 1 = 2 - 1
[5,2]
=> 2 = 3 - 1
[5,1,1]
=> 2 = 3 - 1
[4,3]
=> 3 = 4 - 1
[4,2,1]
=> 3 = 4 - 1
[4,1,1,1]
=> 3 = 4 - 1
[3,3,1]
=> 4 = 5 - 1
[3,2,2]
=> 4 = 5 - 1
[3,2,1,1]
=> 4 = 5 - 1
[3,1,1,1,1]
=> 4 = 5 - 1
[2,2,2,1]
=> 5 = 6 - 1
[2,2,1,1,1]
=> 5 = 6 - 1
[2,1,1,1,1,1]
=> 5 = 6 - 1
[1,1,1,1,1,1,1]
=> 6 = 7 - 1
[8]
=> 0 = 1 - 1
[7,1]
=> 1 = 2 - 1
[6,2]
=> 2 = 3 - 1
[6,1,1]
=> 2 = 3 - 1
[5,3]
=> 3 = 4 - 1
[5,2,1]
=> 3 = 4 - 1
Description
The size of a partition minus its first part.
This is the number of boxes in its diagram that are not in the first row.
Matching statistic: St000507
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
St000507: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000507: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> 1
[2]
=> [[1,2]]
=> 2
[1,1]
=> [[1],[2]]
=> 1
[3]
=> [[1,2,3]]
=> 3
[2,1]
=> [[1,2],[3]]
=> 2
[1,1,1]
=> [[1],[2],[3]]
=> 1
[4]
=> [[1,2,3,4]]
=> 4
[3,1]
=> [[1,2,3],[4]]
=> 3
[2,2]
=> [[1,2],[3,4]]
=> 3
[2,1,1]
=> [[1,2],[3],[4]]
=> 2
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> 1
[5]
=> [[1,2,3,4,5]]
=> 5
[4,1]
=> [[1,2,3,4],[5]]
=> 4
[3,2]
=> [[1,2,3],[4,5]]
=> 4
[3,1,1]
=> [[1,2,3],[4],[5]]
=> 3
[2,2,1]
=> [[1,2],[3,4],[5]]
=> 3
[2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> 2
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> 1
[6]
=> [[1,2,3,4,5,6]]
=> 6
[5,1]
=> [[1,2,3,4,5],[6]]
=> 5
[4,2]
=> [[1,2,3,4],[5,6]]
=> 5
[4,1,1]
=> [[1,2,3,4],[5],[6]]
=> 4
[3,3]
=> [[1,2,3],[4,5,6]]
=> 5
[3,2,1]
=> [[1,2,3],[4,5],[6]]
=> 4
[3,1,1,1]
=> [[1,2,3],[4],[5],[6]]
=> 3
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> 4
[2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> 3
[2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> 2
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> 1
[7]
=> [[1,2,3,4,5,6,7]]
=> 7
[6,1]
=> [[1,2,3,4,5,6],[7]]
=> 6
[5,2]
=> [[1,2,3,4,5],[6,7]]
=> 6
[5,1,1]
=> [[1,2,3,4,5],[6],[7]]
=> 5
[4,3]
=> [[1,2,3,4],[5,6,7]]
=> 6
[4,2,1]
=> [[1,2,3,4],[5,6],[7]]
=> 5
[4,1,1,1]
=> [[1,2,3,4],[5],[6],[7]]
=> 4
[3,3,1]
=> [[1,2,3],[4,5,6],[7]]
=> 5
[3,2,2]
=> [[1,2,3],[4,5],[6,7]]
=> 5
[3,2,1,1]
=> [[1,2,3],[4,5],[6],[7]]
=> 4
[3,1,1,1,1]
=> [[1,2,3],[4],[5],[6],[7]]
=> 3
[2,2,2,1]
=> [[1,2],[3,4],[5,6],[7]]
=> 4
[2,2,1,1,1]
=> [[1,2],[3,4],[5],[6],[7]]
=> 3
[2,1,1,1,1,1]
=> [[1,2],[3],[4],[5],[6],[7]]
=> 2
[1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> 1
[8]
=> [[1,2,3,4,5,6,7,8]]
=> 8
[7,1]
=> [[1,2,3,4,5,6,7],[8]]
=> 7
[6,2]
=> [[1,2,3,4,5,6],[7,8]]
=> 7
[6,1,1]
=> [[1,2,3,4,5,6],[7],[8]]
=> 6
[5,3]
=> [[1,2,3,4,5],[6,7,8]]
=> 7
[5,2,1]
=> [[1,2,3,4,5],[6,7],[8]]
=> 6
Description
The number of ascents of a standard tableau.
Entry $i$ of a standard Young tableau is an '''ascent''' if $i+1$ appears to the right or above $i$ in the tableau (with respect to the English notation for tableaux).
Matching statistic: St000738
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
St000738: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000738: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> 1
[2]
=> [[1,2]]
=> 1
[1,1]
=> [[1],[2]]
=> 2
[3]
=> [[1,2,3]]
=> 1
[2,1]
=> [[1,3],[2]]
=> 2
[1,1,1]
=> [[1],[2],[3]]
=> 3
[4]
=> [[1,2,3,4]]
=> 1
[3,1]
=> [[1,3,4],[2]]
=> 2
[2,2]
=> [[1,2],[3,4]]
=> 3
[2,1,1]
=> [[1,4],[2],[3]]
=> 3
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> 4
[5]
=> [[1,2,3,4,5]]
=> 1
[4,1]
=> [[1,3,4,5],[2]]
=> 2
[3,2]
=> [[1,2,5],[3,4]]
=> 3
[3,1,1]
=> [[1,4,5],[2],[3]]
=> 3
[2,2,1]
=> [[1,3],[2,5],[4]]
=> 4
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> 4
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> 5
[6]
=> [[1,2,3,4,5,6]]
=> 1
[5,1]
=> [[1,3,4,5,6],[2]]
=> 2
[4,2]
=> [[1,2,5,6],[3,4]]
=> 3
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> 3
[3,3]
=> [[1,2,3],[4,5,6]]
=> 4
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> 4
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> 4
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> 5
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> 5
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> 5
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> 6
[7]
=> [[1,2,3,4,5,6,7]]
=> 1
[6,1]
=> [[1,3,4,5,6,7],[2]]
=> 2
[5,2]
=> [[1,2,5,6,7],[3,4]]
=> 3
[5,1,1]
=> [[1,4,5,6,7],[2],[3]]
=> 3
[4,3]
=> [[1,2,3,7],[4,5,6]]
=> 4
[4,2,1]
=> [[1,3,6,7],[2,5],[4]]
=> 4
[4,1,1,1]
=> [[1,5,6,7],[2],[3],[4]]
=> 4
[3,3,1]
=> [[1,3,4],[2,6,7],[5]]
=> 5
[3,2,2]
=> [[1,2,7],[3,4],[5,6]]
=> 5
[3,2,1,1]
=> [[1,4,7],[2,6],[3],[5]]
=> 5
[3,1,1,1,1]
=> [[1,6,7],[2],[3],[4],[5]]
=> 5
[2,2,2,1]
=> [[1,3],[2,5],[4,7],[6]]
=> 6
[2,2,1,1,1]
=> [[1,5],[2,7],[3],[4],[6]]
=> 6
[2,1,1,1,1,1]
=> [[1,7],[2],[3],[4],[5],[6]]
=> 6
[1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> 7
[8]
=> [[1,2,3,4,5,6,7,8]]
=> 1
[7,1]
=> [[1,3,4,5,6,7,8],[2]]
=> 2
[6,2]
=> [[1,2,5,6,7,8],[3,4]]
=> 3
[6,1,1]
=> [[1,4,5,6,7,8],[2],[3]]
=> 3
[5,3]
=> [[1,2,3,7,8],[4,5,6]]
=> 4
[5,2,1]
=> [[1,3,6,7,8],[2,5],[4]]
=> 4
Description
The first entry in the last row of a standard tableau.
For the last entry in the first row, see [[St000734]].
Matching statistic: St000228
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000228: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000228: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> []
=> 0 = 1 - 1
[2]
=> []
=> 0 = 1 - 1
[1,1]
=> [1]
=> 1 = 2 - 1
[3]
=> []
=> 0 = 1 - 1
[2,1]
=> [1]
=> 1 = 2 - 1
[1,1,1]
=> [1,1]
=> 2 = 3 - 1
[4]
=> []
=> 0 = 1 - 1
[3,1]
=> [1]
=> 1 = 2 - 1
[2,2]
=> [2]
=> 2 = 3 - 1
[2,1,1]
=> [1,1]
=> 2 = 3 - 1
[1,1,1,1]
=> [1,1,1]
=> 3 = 4 - 1
[5]
=> []
=> 0 = 1 - 1
[4,1]
=> [1]
=> 1 = 2 - 1
[3,2]
=> [2]
=> 2 = 3 - 1
[3,1,1]
=> [1,1]
=> 2 = 3 - 1
[2,2,1]
=> [2,1]
=> 3 = 4 - 1
[2,1,1,1]
=> [1,1,1]
=> 3 = 4 - 1
[1,1,1,1,1]
=> [1,1,1,1]
=> 4 = 5 - 1
[6]
=> []
=> 0 = 1 - 1
[5,1]
=> [1]
=> 1 = 2 - 1
[4,2]
=> [2]
=> 2 = 3 - 1
[4,1,1]
=> [1,1]
=> 2 = 3 - 1
[3,3]
=> [3]
=> 3 = 4 - 1
[3,2,1]
=> [2,1]
=> 3 = 4 - 1
[3,1,1,1]
=> [1,1,1]
=> 3 = 4 - 1
[2,2,2]
=> [2,2]
=> 4 = 5 - 1
[2,2,1,1]
=> [2,1,1]
=> 4 = 5 - 1
[2,1,1,1,1]
=> [1,1,1,1]
=> 4 = 5 - 1
[1,1,1,1,1,1]
=> [1,1,1,1,1]
=> 5 = 6 - 1
[7]
=> []
=> 0 = 1 - 1
[6,1]
=> [1]
=> 1 = 2 - 1
[5,2]
=> [2]
=> 2 = 3 - 1
[5,1,1]
=> [1,1]
=> 2 = 3 - 1
[4,3]
=> [3]
=> 3 = 4 - 1
[4,2,1]
=> [2,1]
=> 3 = 4 - 1
[4,1,1,1]
=> [1,1,1]
=> 3 = 4 - 1
[3,3,1]
=> [3,1]
=> 4 = 5 - 1
[3,2,2]
=> [2,2]
=> 4 = 5 - 1
[3,2,1,1]
=> [2,1,1]
=> 4 = 5 - 1
[3,1,1,1,1]
=> [1,1,1,1]
=> 4 = 5 - 1
[2,2,2,1]
=> [2,2,1]
=> 5 = 6 - 1
[2,2,1,1,1]
=> [2,1,1,1]
=> 5 = 6 - 1
[2,1,1,1,1,1]
=> [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> 6 = 7 - 1
[8]
=> []
=> 0 = 1 - 1
[7,1]
=> [1]
=> 1 = 2 - 1
[6,2]
=> [2]
=> 2 = 3 - 1
[6,1,1]
=> [1,1]
=> 2 = 3 - 1
[5,3]
=> [3]
=> 3 = 4 - 1
[5,2,1]
=> [2,1]
=> 3 = 4 - 1
Description
The size of a partition.
This statistic is the constant statistic of the level sets.
Matching statistic: St000054
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000054: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000054: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> [1] => 1
[2]
=> [[1,2]]
=> [1,2] => 1
[1,1]
=> [[1],[2]]
=> [2,1] => 2
[3]
=> [[1,2,3]]
=> [1,2,3] => 1
[2,1]
=> [[1,3],[2]]
=> [2,1,3] => 2
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => 3
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => 1
[3,1]
=> [[1,3,4],[2]]
=> [2,1,3,4] => 2
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => 3
[2,1,1]
=> [[1,4],[2],[3]]
=> [3,2,1,4] => 3
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => 4
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1
[4,1]
=> [[1,3,4,5],[2]]
=> [2,1,3,4,5] => 2
[3,2]
=> [[1,2,5],[3,4]]
=> [3,4,1,2,5] => 3
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [3,2,1,4,5] => 3
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [4,2,5,1,3] => 4
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> [4,3,2,1,5] => 4
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => 5
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => 1
[5,1]
=> [[1,3,4,5,6],[2]]
=> [2,1,3,4,5,6] => 2
[4,2]
=> [[1,2,5,6],[3,4]]
=> [3,4,1,2,5,6] => 3
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [3,2,1,4,5,6] => 3
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => 4
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [4,2,5,1,3,6] => 4
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> [4,3,2,1,5,6] => 4
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => 5
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [5,3,2,6,1,4] => 5
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> [5,4,3,2,1,6] => 5
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => 6
[7]
=> [[1,2,3,4,5,6,7]]
=> [1,2,3,4,5,6,7] => 1
[6,1]
=> [[1,3,4,5,6,7],[2]]
=> [2,1,3,4,5,6,7] => 2
[5,2]
=> [[1,2,5,6,7],[3,4]]
=> [3,4,1,2,5,6,7] => 3
[5,1,1]
=> [[1,4,5,6,7],[2],[3]]
=> [3,2,1,4,5,6,7] => 3
[4,3]
=> [[1,2,3,7],[4,5,6]]
=> [4,5,6,1,2,3,7] => 4
[4,2,1]
=> [[1,3,6,7],[2,5],[4]]
=> [4,2,5,1,3,6,7] => 4
[4,1,1,1]
=> [[1,5,6,7],[2],[3],[4]]
=> [4,3,2,1,5,6,7] => 4
[3,3,1]
=> [[1,3,4],[2,6,7],[5]]
=> [5,2,6,7,1,3,4] => 5
[3,2,2]
=> [[1,2,7],[3,4],[5,6]]
=> [5,6,3,4,1,2,7] => 5
[3,2,1,1]
=> [[1,4,7],[2,6],[3],[5]]
=> [5,3,2,6,1,4,7] => 5
[3,1,1,1,1]
=> [[1,6,7],[2],[3],[4],[5]]
=> [5,4,3,2,1,6,7] => 5
[2,2,2,1]
=> [[1,3],[2,5],[4,7],[6]]
=> [6,4,7,2,5,1,3] => 6
[2,2,1,1,1]
=> [[1,5],[2,7],[3],[4],[6]]
=> [6,4,3,2,7,1,5] => 6
[2,1,1,1,1,1]
=> [[1,7],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1,7] => 6
[1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> [7,6,5,4,3,2,1] => 7
[8]
=> [[1,2,3,4,5,6,7,8]]
=> [1,2,3,4,5,6,7,8] => 1
[7,1]
=> [[1,3,4,5,6,7,8],[2]]
=> [2,1,3,4,5,6,7,8] => 2
[6,2]
=> [[1,2,5,6,7,8],[3,4]]
=> [3,4,1,2,5,6,7,8] => 3
[6,1,1]
=> [[1,4,5,6,7,8],[2],[3]]
=> [3,2,1,4,5,6,7,8] => 3
[5,3]
=> [[1,2,3,7,8],[4,5,6]]
=> [4,5,6,1,2,3,7,8] => 4
[5,2,1]
=> [[1,3,6,7,8],[2,5],[4]]
=> [4,2,5,1,3,6,7,8] => 4
Description
The first entry of the permutation.
This can be described as 1 plus the number of occurrences of the vincular pattern ([2,1], {(0,0),(0,1),(0,2)}), i.e., the first column is shaded, see [1].
This statistic is related to the number of deficiencies [[St000703]] as follows: consider the arc diagram of a permutation $\pi$ of $n$, together with its rotations, obtained by conjugating with the long cycle $(1,\dots,n)$. Drawing the labels $1$ to $n$ in this order on a circle, and the arcs $(i, \pi(i))$ as straight lines, the rotation of $\pi$ is obtained by replacing each number $i$ by $(i\bmod n) +1$. Then, $\pi(1)-1$ is the number of rotations of $\pi$ where the arc $(1, \pi(1))$ is a deficiency. In particular, if $O(\pi)$ is the orbit of rotations of $\pi$, then the number of deficiencies of $\pi$ equals
$$
\frac{1}{|O(\pi)|}\sum_{\sigma\in O(\pi)} (\sigma(1)-1).
$$
Matching statistic: St000734
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
Mp00084: Standard tableaux —conjugate⟶ Standard tableaux
St000734: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00084: Standard tableaux —conjugate⟶ Standard tableaux
St000734: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> [[1]]
=> 1
[2]
=> [[1,2]]
=> [[1],[2]]
=> 1
[1,1]
=> [[1],[2]]
=> [[1,2]]
=> 2
[3]
=> [[1,2,3]]
=> [[1],[2],[3]]
=> 1
[2,1]
=> [[1,3],[2]]
=> [[1,2],[3]]
=> 2
[1,1,1]
=> [[1],[2],[3]]
=> [[1,2,3]]
=> 3
[4]
=> [[1,2,3,4]]
=> [[1],[2],[3],[4]]
=> 1
[3,1]
=> [[1,3,4],[2]]
=> [[1,2],[3],[4]]
=> 2
[2,2]
=> [[1,2],[3,4]]
=> [[1,3],[2,4]]
=> 3
[2,1,1]
=> [[1,4],[2],[3]]
=> [[1,2,3],[4]]
=> 3
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [[1,2,3,4]]
=> 4
[5]
=> [[1,2,3,4,5]]
=> [[1],[2],[3],[4],[5]]
=> 1
[4,1]
=> [[1,3,4,5],[2]]
=> [[1,2],[3],[4],[5]]
=> 2
[3,2]
=> [[1,2,5],[3,4]]
=> [[1,3],[2,4],[5]]
=> 3
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [[1,2,3],[4],[5]]
=> 3
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [[1,2,4],[3,5]]
=> 4
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> [[1,2,3,4],[5]]
=> 4
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [[1,2,3,4,5]]
=> 5
[6]
=> [[1,2,3,4,5,6]]
=> [[1],[2],[3],[4],[5],[6]]
=> 1
[5,1]
=> [[1,3,4,5,6],[2]]
=> [[1,2],[3],[4],[5],[6]]
=> 2
[4,2]
=> [[1,2,5,6],[3,4]]
=> [[1,3],[2,4],[5],[6]]
=> 3
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [[1,2,3],[4],[5],[6]]
=> 3
[3,3]
=> [[1,2,3],[4,5,6]]
=> [[1,4],[2,5],[3,6]]
=> 4
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [[1,2,4],[3,5],[6]]
=> 4
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> [[1,2,3,4],[5],[6]]
=> 4
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [[1,3,5],[2,4,6]]
=> 5
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [[1,2,3,5],[4,6]]
=> 5
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> [[1,2,3,4,5],[6]]
=> 5
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [[1,2,3,4,5,6]]
=> 6
[7]
=> [[1,2,3,4,5,6,7]]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> 1
[6,1]
=> [[1,3,4,5,6,7],[2]]
=> [[1,2],[3],[4],[5],[6],[7]]
=> 2
[5,2]
=> [[1,2,5,6,7],[3,4]]
=> [[1,3],[2,4],[5],[6],[7]]
=> 3
[5,1,1]
=> [[1,4,5,6,7],[2],[3]]
=> [[1,2,3],[4],[5],[6],[7]]
=> 3
[4,3]
=> [[1,2,3,7],[4,5,6]]
=> [[1,4],[2,5],[3,6],[7]]
=> 4
[4,2,1]
=> [[1,3,6,7],[2,5],[4]]
=> [[1,2,4],[3,5],[6],[7]]
=> 4
[4,1,1,1]
=> [[1,5,6,7],[2],[3],[4]]
=> [[1,2,3,4],[5],[6],[7]]
=> 4
[3,3,1]
=> [[1,3,4],[2,6,7],[5]]
=> [[1,2,5],[3,6],[4,7]]
=> 5
[3,2,2]
=> [[1,2,7],[3,4],[5,6]]
=> [[1,3,5],[2,4,6],[7]]
=> 5
[3,2,1,1]
=> [[1,4,7],[2,6],[3],[5]]
=> [[1,2,3,5],[4,6],[7]]
=> 5
[3,1,1,1,1]
=> [[1,6,7],[2],[3],[4],[5]]
=> [[1,2,3,4,5],[6],[7]]
=> 5
[2,2,2,1]
=> [[1,3],[2,5],[4,7],[6]]
=> [[1,2,4,6],[3,5,7]]
=> 6
[2,2,1,1,1]
=> [[1,5],[2,7],[3],[4],[6]]
=> [[1,2,3,4,6],[5,7]]
=> 6
[2,1,1,1,1,1]
=> [[1,7],[2],[3],[4],[5],[6]]
=> [[1,2,3,4,5,6],[7]]
=> 6
[1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> [[1,2,3,4,5,6,7]]
=> 7
[8]
=> [[1,2,3,4,5,6,7,8]]
=> [[1],[2],[3],[4],[5],[6],[7],[8]]
=> 1
[7,1]
=> [[1,3,4,5,6,7,8],[2]]
=> [[1,2],[3],[4],[5],[6],[7],[8]]
=> 2
[6,2]
=> [[1,2,5,6,7,8],[3,4]]
=> [[1,3],[2,4],[5],[6],[7],[8]]
=> 3
[6,1,1]
=> [[1,4,5,6,7,8],[2],[3]]
=> [[1,2,3],[4],[5],[6],[7],[8]]
=> 3
[5,3]
=> [[1,2,3,7,8],[4,5,6]]
=> [[1,4],[2,5],[3,6],[7],[8]]
=> 4
[5,2,1]
=> [[1,3,6,7,8],[2,5],[4]]
=> [[1,2,4],[3,5],[6],[7],[8]]
=> 4
Description
The last entry in the first row of a standard tableau.
Matching statistic: St000074
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00082: Standard tableaux —to Gelfand-Tsetlin pattern⟶ Gelfand-Tsetlin patterns
St000074: Gelfand-Tsetlin patterns ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00082: Standard tableaux —to Gelfand-Tsetlin pattern⟶ Gelfand-Tsetlin patterns
St000074: Gelfand-Tsetlin patterns ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> [[1]]
=> 0 = 1 - 1
[2]
=> [[1,2]]
=> [[2,0],[1]]
=> 1 = 2 - 1
[1,1]
=> [[1],[2]]
=> [[1,1],[1]]
=> 0 = 1 - 1
[3]
=> [[1,2,3]]
=> [[3,0,0],[2,0],[1]]
=> 2 = 3 - 1
[2,1]
=> [[1,2],[3]]
=> [[2,1,0],[2,0],[1]]
=> 1 = 2 - 1
[1,1,1]
=> [[1],[2],[3]]
=> [[1,1,1],[1,1],[1]]
=> 0 = 1 - 1
[4]
=> [[1,2,3,4]]
=> [[4,0,0,0],[3,0,0],[2,0],[1]]
=> 3 = 4 - 1
[3,1]
=> [[1,2,3],[4]]
=> [[3,1,0,0],[3,0,0],[2,0],[1]]
=> 2 = 3 - 1
[2,2]
=> [[1,2],[3,4]]
=> [[2,2,0,0],[2,1,0],[2,0],[1]]
=> 2 = 3 - 1
[2,1,1]
=> [[1,2],[3],[4]]
=> [[2,1,1,0],[2,1,0],[2,0],[1]]
=> 1 = 2 - 1
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [[1,1,1,1],[1,1,1],[1,1],[1]]
=> 0 = 1 - 1
[5]
=> [[1,2,3,4,5]]
=> [[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 4 = 5 - 1
[4,1]
=> [[1,2,3,4],[5]]
=> [[4,1,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 3 = 4 - 1
[3,2]
=> [[1,2,3],[4,5]]
=> [[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> 3 = 4 - 1
[3,1,1]
=> [[1,2,3],[4],[5]]
=> [[3,1,1,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> 2 = 3 - 1
[2,2,1]
=> [[1,2],[3,4],[5]]
=> [[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 2 = 3 - 1
[2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> [[2,1,1,1,0],[2,1,1,0],[2,1,0],[2,0],[1]]
=> 1 = 2 - 1
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [[1,1,1,1,1],[1,1,1,1],[1,1,1],[1,1],[1]]
=> 0 = 1 - 1
[6]
=> [[1,2,3,4,5,6]]
=> [[6,0,0,0,0,0],[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 5 = 6 - 1
[5,1]
=> [[1,2,3,4,5],[6]]
=> [[5,1,0,0,0,0],[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 4 = 5 - 1
[4,2]
=> [[1,2,3,4],[5,6]]
=> [[4,2,0,0,0,0],[4,1,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 4 = 5 - 1
[4,1,1]
=> [[1,2,3,4],[5],[6]]
=> [[4,1,1,0,0,0],[4,1,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 3 = 4 - 1
[3,3]
=> [[1,2,3],[4,5,6]]
=> [[3,3,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> 4 = 5 - 1
[3,2,1]
=> [[1,2,3],[4,5],[6]]
=> [[3,2,1,0,0,0],[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> 3 = 4 - 1
[3,1,1,1]
=> [[1,2,3],[4],[5],[6]]
=> [[3,1,1,1,0,0],[3,1,1,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> 2 = 3 - 1
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 3 = 4 - 1
[2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [[2,2,1,1,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 2 = 3 - 1
[2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> [[2,1,1,1,1,0],[2,1,1,1,0],[2,1,1,0],[2,1,0],[2,0],[1]]
=> 1 = 2 - 1
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [[1,1,1,1,1,1],[1,1,1,1,1],[1,1,1,1],[1,1,1],[1,1],[1]]
=> 0 = 1 - 1
[7]
=> [[1,2,3,4,5,6,7]]
=> [[7,0,0,0,0,0,0],[6,0,0,0,0,0],[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 6 = 7 - 1
[6,1]
=> [[1,2,3,4,5,6],[7]]
=> [[6,1,0,0,0,0,0],[6,0,0,0,0,0],[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 5 = 6 - 1
[5,2]
=> [[1,2,3,4,5],[6,7]]
=> [[5,2,0,0,0,0,0],[5,1,0,0,0,0],[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 5 = 6 - 1
[5,1,1]
=> [[1,2,3,4,5],[6],[7]]
=> [[5,1,1,0,0,0,0],[5,1,0,0,0,0],[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 4 = 5 - 1
[4,3]
=> [[1,2,3,4],[5,6,7]]
=> [[4,3,0,0,0,0,0],[4,2,0,0,0,0],[4,1,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 5 = 6 - 1
[4,2,1]
=> [[1,2,3,4],[5,6],[7]]
=> [[4,2,1,0,0,0,0],[4,2,0,0,0,0],[4,1,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 4 = 5 - 1
[4,1,1,1]
=> [[1,2,3,4],[5],[6],[7]]
=> [[4,1,1,1,0,0,0],[4,1,1,0,0,0],[4,1,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 3 = 4 - 1
[3,3,1]
=> [[1,2,3],[4,5,6],[7]]
=> [[3,3,1,0,0,0,0],[3,3,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> 4 = 5 - 1
[3,2,2]
=> [[1,2,3],[4,5],[6,7]]
=> [[3,2,2,0,0,0,0],[3,2,1,0,0,0],[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> 4 = 5 - 1
[3,2,1,1]
=> [[1,2,3],[4,5],[6],[7]]
=> [[3,2,1,1,0,0,0],[3,2,1,0,0,0],[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> 3 = 4 - 1
[3,1,1,1,1]
=> [[1,2,3],[4],[5],[6],[7]]
=> [[3,1,1,1,1,0,0],[3,1,1,1,0,0],[3,1,1,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> 2 = 3 - 1
[2,2,2,1]
=> [[1,2],[3,4],[5,6],[7]]
=> [[2,2,2,1,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 3 = 4 - 1
[2,2,1,1,1]
=> [[1,2],[3,4],[5],[6],[7]]
=> [[2,2,1,1,1,0,0],[2,2,1,1,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 2 = 3 - 1
[2,1,1,1,1,1]
=> [[1,2],[3],[4],[5],[6],[7]]
=> [[2,1,1,1,1,1,0],[2,1,1,1,1,0],[2,1,1,1,0],[2,1,1,0],[2,1,0],[2,0],[1]]
=> 1 = 2 - 1
[1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> [[1,1,1,1,1,1,1],[1,1,1,1,1,1],[1,1,1,1,1],[1,1,1,1],[1,1,1],[1,1],[1]]
=> 0 = 1 - 1
[8]
=> [[1,2,3,4,5,6,7,8]]
=> [[8,0,0,0,0,0,0,0],[7,0,0,0,0,0,0],[6,0,0,0,0,0],[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 7 = 8 - 1
[7,1]
=> [[1,2,3,4,5,6,7],[8]]
=> [[7,1,0,0,0,0,0,0],[7,0,0,0,0,0,0],[6,0,0,0,0,0],[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 6 = 7 - 1
[6,2]
=> [[1,2,3,4,5,6],[7,8]]
=> [[6,2,0,0,0,0,0,0],[6,1,0,0,0,0,0],[6,0,0,0,0,0],[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 6 = 7 - 1
[6,1,1]
=> [[1,2,3,4,5,6],[7],[8]]
=> [[6,1,1,0,0,0,0,0],[6,1,0,0,0,0,0],[6,0,0,0,0,0],[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 5 = 6 - 1
[5,3]
=> [[1,2,3,4,5],[6,7,8]]
=> [[5,3,0,0,0,0,0,0],[5,2,0,0,0,0,0],[5,1,0,0,0,0],[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 6 = 7 - 1
[5,2,1]
=> [[1,2,3,4,5],[6,7],[8]]
=> [[5,2,1,0,0,0,0,0],[5,2,0,0,0,0,0],[5,1,0,0,0,0],[5,0,0,0,0],[4,0,0,0],[3,0,0],[2,0],[1]]
=> 5 = 6 - 1
Description
The number of special entries.
An entry $a_{i,j}$ of a Gelfand-Tsetlin pattern is special if $a_{i-1,j-i} > a_{i,j} > a_{i-1,j}$. That is, it is neither boxed nor circled.
Matching statistic: St000141
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000141: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000141: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> [1] => 0 = 1 - 1
[2]
=> [[1,2]]
=> [1,2] => 0 = 1 - 1
[1,1]
=> [[1],[2]]
=> [2,1] => 1 = 2 - 1
[3]
=> [[1,2,3]]
=> [1,2,3] => 0 = 1 - 1
[2,1]
=> [[1,3],[2]]
=> [2,1,3] => 1 = 2 - 1
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => 2 = 3 - 1
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => 0 = 1 - 1
[3,1]
=> [[1,3,4],[2]]
=> [2,1,3,4] => 1 = 2 - 1
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => 2 = 3 - 1
[2,1,1]
=> [[1,4],[2],[3]]
=> [3,2,1,4] => 2 = 3 - 1
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => 3 = 4 - 1
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 0 = 1 - 1
[4,1]
=> [[1,3,4,5],[2]]
=> [2,1,3,4,5] => 1 = 2 - 1
[3,2]
=> [[1,2,5],[3,4]]
=> [3,4,1,2,5] => 2 = 3 - 1
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [3,2,1,4,5] => 2 = 3 - 1
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [4,2,5,1,3] => 3 = 4 - 1
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> [4,3,2,1,5] => 3 = 4 - 1
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => 4 = 5 - 1
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => 0 = 1 - 1
[5,1]
=> [[1,3,4,5,6],[2]]
=> [2,1,3,4,5,6] => 1 = 2 - 1
[4,2]
=> [[1,2,5,6],[3,4]]
=> [3,4,1,2,5,6] => 2 = 3 - 1
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [3,2,1,4,5,6] => 2 = 3 - 1
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => 3 = 4 - 1
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [4,2,5,1,3,6] => 3 = 4 - 1
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> [4,3,2,1,5,6] => 3 = 4 - 1
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => 4 = 5 - 1
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [5,3,2,6,1,4] => 4 = 5 - 1
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> [5,4,3,2,1,6] => 4 = 5 - 1
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => 5 = 6 - 1
[7]
=> [[1,2,3,4,5,6,7]]
=> [1,2,3,4,5,6,7] => 0 = 1 - 1
[6,1]
=> [[1,3,4,5,6,7],[2]]
=> [2,1,3,4,5,6,7] => 1 = 2 - 1
[5,2]
=> [[1,2,5,6,7],[3,4]]
=> [3,4,1,2,5,6,7] => 2 = 3 - 1
[5,1,1]
=> [[1,4,5,6,7],[2],[3]]
=> [3,2,1,4,5,6,7] => 2 = 3 - 1
[4,3]
=> [[1,2,3,7],[4,5,6]]
=> [4,5,6,1,2,3,7] => 3 = 4 - 1
[4,2,1]
=> [[1,3,6,7],[2,5],[4]]
=> [4,2,5,1,3,6,7] => 3 = 4 - 1
[4,1,1,1]
=> [[1,5,6,7],[2],[3],[4]]
=> [4,3,2,1,5,6,7] => 3 = 4 - 1
[3,3,1]
=> [[1,3,4],[2,6,7],[5]]
=> [5,2,6,7,1,3,4] => 4 = 5 - 1
[3,2,2]
=> [[1,2,7],[3,4],[5,6]]
=> [5,6,3,4,1,2,7] => 4 = 5 - 1
[3,2,1,1]
=> [[1,4,7],[2,6],[3],[5]]
=> [5,3,2,6,1,4,7] => 4 = 5 - 1
[3,1,1,1,1]
=> [[1,6,7],[2],[3],[4],[5]]
=> [5,4,3,2,1,6,7] => 4 = 5 - 1
[2,2,2,1]
=> [[1,3],[2,5],[4,7],[6]]
=> [6,4,7,2,5,1,3] => 5 = 6 - 1
[2,2,1,1,1]
=> [[1,5],[2,7],[3],[4],[6]]
=> [6,4,3,2,7,1,5] => 5 = 6 - 1
[2,1,1,1,1,1]
=> [[1,7],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1,7] => 5 = 6 - 1
[1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> [7,6,5,4,3,2,1] => 6 = 7 - 1
[8]
=> [[1,2,3,4,5,6,7,8]]
=> [1,2,3,4,5,6,7,8] => 0 = 1 - 1
[7,1]
=> [[1,3,4,5,6,7,8],[2]]
=> [2,1,3,4,5,6,7,8] => 1 = 2 - 1
[6,2]
=> [[1,2,5,6,7,8],[3,4]]
=> [3,4,1,2,5,6,7,8] => 2 = 3 - 1
[6,1,1]
=> [[1,4,5,6,7,8],[2],[3]]
=> [3,2,1,4,5,6,7,8] => 2 = 3 - 1
[5,3]
=> [[1,2,3,7,8],[4,5,6]]
=> [4,5,6,1,2,3,7,8] => 3 = 4 - 1
[5,2,1]
=> [[1,3,6,7,8],[2,5],[4]]
=> [4,2,5,1,3,6,7,8] => 3 = 4 - 1
Description
The maximum drop size of a permutation.
The maximum drop size of a permutation $\pi$ of $[n]=\{1,2,\ldots, n\}$ is defined to be the maximum value of $i-\pi(i)$.
Matching statistic: St000157
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00084: Standard tableaux —conjugate⟶ Standard tableaux
St000157: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00084: Standard tableaux —conjugate⟶ Standard tableaux
St000157: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [[1]]
=> [[1]]
=> 0 = 1 - 1
[2]
=> [[1,2]]
=> [[1],[2]]
=> 1 = 2 - 1
[1,1]
=> [[1],[2]]
=> [[1,2]]
=> 0 = 1 - 1
[3]
=> [[1,2,3]]
=> [[1],[2],[3]]
=> 2 = 3 - 1
[2,1]
=> [[1,2],[3]]
=> [[1,3],[2]]
=> 1 = 2 - 1
[1,1,1]
=> [[1],[2],[3]]
=> [[1,2,3]]
=> 0 = 1 - 1
[4]
=> [[1,2,3,4]]
=> [[1],[2],[3],[4]]
=> 3 = 4 - 1
[3,1]
=> [[1,2,3],[4]]
=> [[1,4],[2],[3]]
=> 2 = 3 - 1
[2,2]
=> [[1,2],[3,4]]
=> [[1,3],[2,4]]
=> 2 = 3 - 1
[2,1,1]
=> [[1,2],[3],[4]]
=> [[1,3,4],[2]]
=> 1 = 2 - 1
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [[1,2,3,4]]
=> 0 = 1 - 1
[5]
=> [[1,2,3,4,5]]
=> [[1],[2],[3],[4],[5]]
=> 4 = 5 - 1
[4,1]
=> [[1,2,3,4],[5]]
=> [[1,5],[2],[3],[4]]
=> 3 = 4 - 1
[3,2]
=> [[1,2,3],[4,5]]
=> [[1,4],[2,5],[3]]
=> 3 = 4 - 1
[3,1,1]
=> [[1,2,3],[4],[5]]
=> [[1,4,5],[2],[3]]
=> 2 = 3 - 1
[2,2,1]
=> [[1,2],[3,4],[5]]
=> [[1,3,5],[2,4]]
=> 2 = 3 - 1
[2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> [[1,3,4,5],[2]]
=> 1 = 2 - 1
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [[1,2,3,4,5]]
=> 0 = 1 - 1
[6]
=> [[1,2,3,4,5,6]]
=> [[1],[2],[3],[4],[5],[6]]
=> 5 = 6 - 1
[5,1]
=> [[1,2,3,4,5],[6]]
=> [[1,6],[2],[3],[4],[5]]
=> 4 = 5 - 1
[4,2]
=> [[1,2,3,4],[5,6]]
=> [[1,5],[2,6],[3],[4]]
=> 4 = 5 - 1
[4,1,1]
=> [[1,2,3,4],[5],[6]]
=> [[1,5,6],[2],[3],[4]]
=> 3 = 4 - 1
[3,3]
=> [[1,2,3],[4,5,6]]
=> [[1,4],[2,5],[3,6]]
=> 4 = 5 - 1
[3,2,1]
=> [[1,2,3],[4,5],[6]]
=> [[1,4,6],[2,5],[3]]
=> 3 = 4 - 1
[3,1,1,1]
=> [[1,2,3],[4],[5],[6]]
=> [[1,4,5,6],[2],[3]]
=> 2 = 3 - 1
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [[1,3,5],[2,4,6]]
=> 3 = 4 - 1
[2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [[1,3,5,6],[2,4]]
=> 2 = 3 - 1
[2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> [[1,3,4,5,6],[2]]
=> 1 = 2 - 1
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [[1,2,3,4,5,6]]
=> 0 = 1 - 1
[7]
=> [[1,2,3,4,5,6,7]]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> 6 = 7 - 1
[6,1]
=> [[1,2,3,4,5,6],[7]]
=> [[1,7],[2],[3],[4],[5],[6]]
=> 5 = 6 - 1
[5,2]
=> [[1,2,3,4,5],[6,7]]
=> [[1,6],[2,7],[3],[4],[5]]
=> 5 = 6 - 1
[5,1,1]
=> [[1,2,3,4,5],[6],[7]]
=> [[1,6,7],[2],[3],[4],[5]]
=> 4 = 5 - 1
[4,3]
=> [[1,2,3,4],[5,6,7]]
=> [[1,5],[2,6],[3,7],[4]]
=> 5 = 6 - 1
[4,2,1]
=> [[1,2,3,4],[5,6],[7]]
=> [[1,5,7],[2,6],[3],[4]]
=> 4 = 5 - 1
[4,1,1,1]
=> [[1,2,3,4],[5],[6],[7]]
=> [[1,5,6,7],[2],[3],[4]]
=> 3 = 4 - 1
[3,3,1]
=> [[1,2,3],[4,5,6],[7]]
=> [[1,4,7],[2,5],[3,6]]
=> 4 = 5 - 1
[3,2,2]
=> [[1,2,3],[4,5],[6,7]]
=> [[1,4,6],[2,5,7],[3]]
=> 4 = 5 - 1
[3,2,1,1]
=> [[1,2,3],[4,5],[6],[7]]
=> [[1,4,6,7],[2,5],[3]]
=> 3 = 4 - 1
[3,1,1,1,1]
=> [[1,2,3],[4],[5],[6],[7]]
=> [[1,4,5,6,7],[2],[3]]
=> 2 = 3 - 1
[2,2,2,1]
=> [[1,2],[3,4],[5,6],[7]]
=> [[1,3,5,7],[2,4,6]]
=> 3 = 4 - 1
[2,2,1,1,1]
=> [[1,2],[3,4],[5],[6],[7]]
=> [[1,3,5,6,7],[2,4]]
=> 2 = 3 - 1
[2,1,1,1,1,1]
=> [[1,2],[3],[4],[5],[6],[7]]
=> [[1,3,4,5,6,7],[2]]
=> 1 = 2 - 1
[1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> [[1,2,3,4,5,6,7]]
=> 0 = 1 - 1
[8]
=> [[1,2,3,4,5,6,7,8]]
=> [[1],[2],[3],[4],[5],[6],[7],[8]]
=> 7 = 8 - 1
[7,1]
=> [[1,2,3,4,5,6,7],[8]]
=> [[1,8],[2],[3],[4],[5],[6],[7]]
=> 6 = 7 - 1
[6,2]
=> [[1,2,3,4,5,6],[7,8]]
=> [[1,7],[2,8],[3],[4],[5],[6]]
=> 6 = 7 - 1
[6,1,1]
=> [[1,2,3,4,5,6],[7],[8]]
=> [[1,7,8],[2],[3],[4],[5],[6]]
=> 5 = 6 - 1
[5,3]
=> [[1,2,3,4,5],[6,7,8]]
=> [[1,6],[2,7],[3,8],[4],[5]]
=> 6 = 7 - 1
[5,2,1]
=> [[1,2,3,4,5],[6,7],[8]]
=> [[1,6,8],[2,7],[3],[4],[5]]
=> 5 = 6 - 1
Description
The number of descents of a standard tableau.
Entry $i$ of a standard Young tableau is a descent if $i+1$ appears in a row below the row of $i$.
The following 185 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000245The number of ascents of a permutation. St000293The number of inversions of a binary word. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000441The number of successions of a permutation. St000662The staircase size of the code of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St001034The area of the parallelogram polyomino associated with the Dyck path. St000010The length of the partition. St000018The number of inversions of a permutation. St000246The number of non-inversions of a permutation. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000290The major index of a binary word. St000376The bounce deficit of a Dyck path. St000288The number of ones in a binary word. St000369The dinv deficit of a Dyck path. St001228The vector space dimension of the space of module homomorphisms between J and itself when J denotes the Jacobson radical of the corresponding Nakayama algebra. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000013The height of a Dyck path. St000728The dimension of a set partition. St000019The cardinality of the support of a permutation. St001033The normalized area of the parallelogram polyomino associated with the Dyck path. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St000809The reduced reflection length of the permutation. St000957The number of Bruhat lower covers of a permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001726The number of visible inversions of a permutation. St000833The comajor index of a permutation. St000214The number of adjacencies of a permutation. St000539The number of odd inversions of a permutation. St000795The mad of a permutation. St000081The number of edges of a graph. St000439The position of the first down step of a Dyck path. St000794The mak of a permutation. St000839The largest opener of a set partition. St000093The cardinality of a maximal independent set of vertices of a graph. St000067The inversion number of the alternating sign matrix. St000332The positive inversions of an alternating sign matrix. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000727The largest label of a leaf in the binary search tree associated with the permutation. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000029The depth of a permutation. St000224The sorting index of a permutation. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St000240The number of indices that are not small excedances. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000004The major index of a permutation. St000030The sum of the descent differences of a permutations. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St001077The prefix exchange distance of a permutation. 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. St001397Number of pairs of incomparable elements in a finite poset. St001428The number of B-inversions of a signed permutation. St001869The maximum cut size of a graph. St001480The number of simple summands of the module J^2/J^3. St000971The smallest closer of a set partition. St001965The number of decreasable positions in the corner sum matrix of an alternating sign matrix. St000505The biggest entry in the block containing the 1. St000504The cardinality of the first block of a set partition. St001062The maximal size of a block of a set partition. St000502The number of successions of a set partitions. St001809The index of the step at the first peak of maximal height in a Dyck path. St000503The maximal difference between two elements in a common block. St000444The length of the maximal rise of a Dyck path. St000925The number of topologically connected components of a set partition. St000442The maximal area to the right of an up step of a Dyck path. St000874The position of the last double rise in a Dyck path. St000211The rank of the set partition. St000025The number of initial rises of a Dyck path. St000105The number of blocks in the set partition. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001580The acyclic chromatic number of a graph. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000024The number of double up and double down steps of a Dyck path. St000171The degree of the graph. St000272The treewidth of a graph. St000362The size of a minimal vertex cover of a graph. St000536The pathwidth of a graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St000730The maximal arc length of a set partition. St000209Maximum difference of elements in cycles. St001298The number of repeated entries in the Lehmer code of a permutation. St000654The first descent of a permutation. St000844The size of the largest block in the direct sum decomposition of a permutation. St000956The maximal displacement of a permutation. St000740The last entry of a permutation. St001725The harmonious chromatic number of a graph. St001963The tree-depth of a graph. St001277The degeneracy of a graph. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St000470The number of runs in a permutation. St001090The number of pop-stack-sorts needed to sort a permutation. St000670The reversal length of a permutation. St000840The number of closers smaller than the largest opener in a perfect matching. St001489The maximum of the number of descents and the number of inverse descents. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000354The number of recoils of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000831The number of indices that are either descents or recoils. St001061The number of indices that are both descents and recoils of a permutation. St000223The number of nestings in the permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St001644The dimension of a graph. St000454The largest eigenvalue of a graph if it is integral. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001136The largest label with larger sister in the leaf labelled binary unordered tree associated with the perfect matching. St000308The height of the tree associated to a permutation. St000653The last descent of a permutation. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St001497The position of the largest weak excedence of a permutation. St000060The greater neighbor of the maximum. 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. St000316The number of non-left-to-right-maxima of a permutation. St001118The acyclic chromatic index of a graph. St001555The order of a signed permutation. St000005The bounce statistic of a Dyck path. St000133The "bounce" of a permutation. St000673The number of non-fixed points of a permutation. St001082The number of boxed occurrences of 123 in a permutation. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001727The number of invisible inversions of a permutation. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St000898The number of maximal entries in the last diagonal of the monotone triangle. 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. St000327The number of cover relations in a poset. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001760The number of prefix or suffix reversals needed to sort a permutation. St000062The length of the longest increasing subsequence of the permutation. St000213The number of weak exceedances (also weak excedences) of a permutation. St000314The number of left-to-right-maxima of a permutation. St000325The width of the tree associated to a permutation. St000443The number of long tunnels of a Dyck path. St000702The number of weak deficiencies of a permutation. St000991The number of right-to-left minima of a permutation. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. 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. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St000021The number of descents of a permutation. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000051The size of the left subtree of a binary tree. St000155The number of exceedances (also excedences) of a permutation. St000238The number of indices that are not small weak excedances. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St000083The number of left oriented leafs of a binary tree except the first one. St000216The absolute length of a permutation. St001330The hat guessing number of a graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001855The number of signed permutations less than or equal to a signed permutation in left weak order. St001769The reflection length of a signed permutation. St001861The number of Bruhat lower covers of a permutation. St001894The depth of a signed permutation. St000259The diameter of a connected graph. St000422The energy of a graph, if it is integral. St000739The first entry in the last row of a semistandard tableau. St000193The row of the unique '1' in the first column of the alternating sign matrix. St001668The number of points of the poset minus the width of the poset. St001948The number of augmented double ascents of a permutation. St000896The number of zeros on the main diagonal of an alternating sign matrix. St000120The number of left tunnels of a Dyck path. St000766The number of inversions of an integer composition. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. 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. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001821The sorting index of a signed 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)$. St001596The number of two-by-two squares inside a skew partition. St000006The dinv of a Dyck path. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001423The number of distinct cubes in a binary word. St001520The number of strict 3-descents. St001556The number of inversions of the third entry of a permutation. St000691The number of changes of a binary word. St001267The length of the Lyndon factorization of the binary word.
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!