searching the database
Your data matches 50 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: St001669
(load all 24 compositions to match this statistic)
(load all 24 compositions to match this statistic)
St001669: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 2
[1,0,1,0]
=> 4
[1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 6
[1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> 8
[1,0,1,0,1,1,0,0]
=> 4
[1,0,1,1,0,0,1,0]
=> 4
[1,0,1,1,0,1,0,0]
=> 4
[1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> 4
[1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> 4
[1,1,0,1,0,1,0,0]
=> 4
[1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> 10
[1,0,1,0,1,0,1,1,0,0]
=> 6
[1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> 6
[1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,1,1,0,0,0,1,0,0]
=> 1
[1,1,1,1,0,0,1,0,0,0]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 12
Description
The number of single rises in a Dyck path.
A single rise is a step which is neither preceded nor followed by a step of the same kind.
Matching statistic: St000445
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000445: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000445: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 10 => [1,1] => [1,0,1,0]
=> 2
[1,0,1,0]
=> 1010 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,0,0]
=> 1100 => [2,2] => [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 101010 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,1,0,0]
=> 101100 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> 110010 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0]
=> 110100 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 2
[1,1,1,0,0,0]
=> 111000 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> 10101010 => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 8
[1,0,1,0,1,1,0,0]
=> 10101100 => [1,1,1,1,2,2] => [1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,1,0,0,1,0]
=> 10110010 => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> 4
[1,0,1,1,0,1,0,0]
=> 10110100 => [1,1,2,1,1,2] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> 4
[1,0,1,1,1,0,0,0]
=> 10111000 => [1,1,3,3] => [1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> 11001010 => [2,2,1,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> 4
[1,1,0,0,1,1,0,0]
=> 11001100 => [2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> 11010010 => [2,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,0,0]
=> 11010100 => [2,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,0,1,1,0,0,0]
=> 11011000 => [2,1,2,3] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> 11100010 => [3,3,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> 11100100 => [3,2,1,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> 11101000 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> 11110000 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> 1010101010 => [1,1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 10
[1,0,1,0,1,0,1,1,0,0]
=> 1010101100 => [1,1,1,1,1,1,2,2] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> 6
[1,0,1,1,0,0,1,1,0,0]
=> 1011001100 => [1,1,2,2,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => [2,1,1,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 6
[1,1,0,1,1,1,0,0,0,0]
=> 1101110000 => [2,1,3,4] => [1,1,0,0,1,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,1,0,1,1,0,0,0,0]
=> 1110110000 => [3,1,2,4] => [1,1,1,0,0,0,1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,1,1,0,0,0,1,0,0]
=> 1111000100 => [4,3,1,2] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0,1,1,0,0]
=> 1
[1,1,1,1,0,0,1,0,0,0]
=> 1111001000 => [4,2,1,3] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0,1,1,1,0,0,0]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> 1111100000 => [5,5] => [1,1,1,1,1,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 101010101010 => [1,1,1,1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 12
Description
The number of rises of length 1 of a Dyck path.
Matching statistic: St000475
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St000475: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St000475: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 10 => [1,1] => [1,1]
=> 2
[1,0,1,0]
=> 1010 => [1,1,1,1] => [1,1,1,1]
=> 4
[1,1,0,0]
=> 1100 => [2,2] => [2,2]
=> 0
[1,0,1,0,1,0]
=> 101010 => [1,1,1,1,1,1] => [1,1,1,1,1,1]
=> 6
[1,0,1,1,0,0]
=> 101100 => [1,1,2,2] => [2,2,1,1]
=> 2
[1,1,0,0,1,0]
=> 110010 => [2,2,1,1] => [2,2,1,1]
=> 2
[1,1,0,1,0,0]
=> 110100 => [2,1,1,2] => [2,2,1,1]
=> 2
[1,1,1,0,0,0]
=> 111000 => [3,3] => [3,3]
=> 0
[1,0,1,0,1,0,1,0]
=> 10101010 => [1,1,1,1,1,1,1,1] => [1,1,1,1,1,1,1,1]
=> 8
[1,0,1,0,1,1,0,0]
=> 10101100 => [1,1,1,1,2,2] => [2,2,1,1,1,1]
=> 4
[1,0,1,1,0,0,1,0]
=> 10110010 => [1,1,2,2,1,1] => [2,2,1,1,1,1]
=> 4
[1,0,1,1,0,1,0,0]
=> 10110100 => [1,1,2,1,1,2] => [2,2,1,1,1,1]
=> 4
[1,0,1,1,1,0,0,0]
=> 10111000 => [1,1,3,3] => [3,3,1,1]
=> 2
[1,1,0,0,1,0,1,0]
=> 11001010 => [2,2,1,1,1,1] => [2,2,1,1,1,1]
=> 4
[1,1,0,0,1,1,0,0]
=> 11001100 => [2,2,2,2] => [2,2,2,2]
=> 0
[1,1,0,1,0,0,1,0]
=> 11010010 => [2,1,1,2,1,1] => [2,2,1,1,1,1]
=> 4
[1,1,0,1,0,1,0,0]
=> 11010100 => [2,1,1,1,1,2] => [2,2,1,1,1,1]
=> 4
[1,1,0,1,1,0,0,0]
=> 11011000 => [2,1,2,3] => [3,2,2,1]
=> 1
[1,1,1,0,0,0,1,0]
=> 11100010 => [3,3,1,1] => [3,3,1,1]
=> 2
[1,1,1,0,0,1,0,0]
=> 11100100 => [3,2,1,2] => [3,2,2,1]
=> 1
[1,1,1,0,1,0,0,0]
=> 11101000 => [3,1,1,3] => [3,3,1,1]
=> 2
[1,1,1,1,0,0,0,0]
=> 11110000 => [4,4] => [4,4]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> 1010101010 => [1,1,1,1,1,1,1,1,1,1] => [1,1,1,1,1,1,1,1,1,1]
=> 10
[1,0,1,0,1,0,1,1,0,0]
=> 1010101100 => [1,1,1,1,1,1,2,2] => [2,2,1,1,1,1,1,1]
=> 6
[1,0,1,1,0,0,1,1,0,0]
=> 1011001100 => [1,1,2,2,2,2] => [2,2,2,2,1,1]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => [2,1,1,1,1,1,1,2] => [2,2,1,1,1,1,1,1]
=> 6
[1,1,0,1,1,1,0,0,0,0]
=> 1101110000 => [2,1,3,4] => [4,3,2,1]
=> 1
[1,1,1,0,1,1,0,0,0,0]
=> 1110110000 => [3,1,2,4] => [4,3,2,1]
=> 1
[1,1,1,1,0,0,0,1,0,0]
=> 1111000100 => [4,3,1,2] => [4,3,2,1]
=> 1
[1,1,1,1,0,0,1,0,0,0]
=> 1111001000 => [4,2,1,3] => [4,3,2,1]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> 1111100000 => [5,5] => [5,5]
=> 0
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 101010101010 => [1,1,1,1,1,1,1,1,1,1,1,1] => [1,1,1,1,1,1,1,1,1,1,1,1]
=> 12
Description
The number of parts equal to 1 in a partition.
Matching statistic: St000674
Mp00093: Dyck paths —to binary word⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000674: Dyck paths ⟶ ℤResult quality: 56% ●values known / values provided: 56%●distinct values known / distinct values provided: 75%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000674: Dyck paths ⟶ ℤResult quality: 56% ●values known / values provided: 56%●distinct values known / distinct values provided: 75%
Values
[1,0]
=> 10 => [1,1] => [1,0,1,0]
=> 2
[1,0,1,0]
=> 1010 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,0,0]
=> 1100 => [2,2] => [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 101010 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,1,0,0]
=> 101100 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> 110010 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0]
=> 110100 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> 2
[1,1,1,0,0,0]
=> 111000 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> 10101010 => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 8
[1,0,1,0,1,1,0,0]
=> 10101100 => [1,1,1,1,2,2] => [1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> 4
[1,0,1,1,0,0,1,0]
=> 10110010 => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> 4
[1,0,1,1,0,1,0,0]
=> 10110100 => [1,1,2,1,1,2] => [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> 4
[1,0,1,1,1,0,0,0]
=> 10111000 => [1,1,3,3] => [1,0,1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> 11001010 => [2,2,1,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> 4
[1,1,0,0,1,1,0,0]
=> 11001100 => [2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> 11010010 => [2,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,0,0]
=> 11010100 => [2,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,0,1,1,0,0,0]
=> 11011000 => [2,1,2,3] => [1,1,0,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> 11100010 => [3,3,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 2
[1,1,1,0,0,1,0,0]
=> 11100100 => [3,2,1,2] => [1,1,1,0,0,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 1
[1,1,1,0,1,0,0,0]
=> 11101000 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 2
[1,1,1,1,0,0,0,0]
=> 11110000 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 0
[1,0,1,0,1,0,1,0,1,0]
=> 1010101010 => [1,1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 10
[1,0,1,0,1,0,1,1,0,0]
=> 1010101100 => [1,1,1,1,1,1,2,2] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> ? = 6
[1,0,1,1,0,0,1,1,0,0]
=> 1011001100 => [1,1,2,2,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 2
[1,1,0,1,0,1,0,1,0,0]
=> 1101010100 => [2,1,1,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 6
[1,1,0,1,1,1,0,0,0,0]
=> 1101110000 => [2,1,3,4] => [1,1,0,0,1,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> ? = 1
[1,1,1,0,1,1,0,0,0,0]
=> 1110110000 => [3,1,2,4] => [1,1,1,0,0,0,1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> ? = 1
[1,1,1,1,0,0,0,1,0,0]
=> 1111000100 => [4,3,1,2] => [1,1,1,1,0,0,0,0,1,1,1,0,0,0,1,0,1,1,0,0]
=> ? = 1
[1,1,1,1,0,0,1,0,0,0]
=> 1111001000 => [4,2,1,3] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0,1,1,1,0,0,0]
=> ? = 1
[1,1,1,1,1,0,0,0,0,0]
=> 1111100000 => [5,5] => [1,1,1,1,1,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0]
=> ? = 0
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 101010101010 => [1,1,1,1,1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 12
Description
The number of hills of a Dyck path.
A hill is a peak with up step starting and down step ending at height zero.
Matching statistic: St001459
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001459: Graphs ⟶ ℤResult quality: 25% ●values known / values provided: 25%●distinct values known / distinct values provided: 50%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001459: Graphs ⟶ ℤResult quality: 25% ●values known / values provided: 25%●distinct values known / distinct values provided: 50%
Values
[1,0]
=> [[1],[2]]
=> [2,1] => ([(0,1)],2)
=> 2
[1,0,1,0]
=> [[1,3],[2,4]]
=> [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 4
[1,1,0,0]
=> [[1,2],[3,4]]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 0
[1,0,1,0,1,0]
=> [[1,3,5],[2,4,6]]
=> [2,4,6,1,3,5] => ([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> 6
[1,0,1,1,0,0]
=> [[1,3,4],[2,5,6]]
=> [2,5,6,1,3,4] => ([(0,5),(1,3),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> 2
[1,1,0,0,1,0]
=> [[1,2,5],[3,4,6]]
=> [3,4,6,1,2,5] => ([(0,5),(1,3),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> 2
[1,1,0,1,0,0]
=> [[1,2,4],[3,5,6]]
=> [3,5,6,1,2,4] => ([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6)
=> 2
[1,1,1,0,0,0]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 0
[1,0,1,0,1,0,1,0]
=> [[1,3,5,7],[2,4,6,8]]
=> [2,4,6,8,1,3,5,7] => ([(0,7),(1,6),(2,5),(2,6),(3,4),(3,7),(4,5),(4,6),(5,7),(6,7)],8)
=> ? = 8
[1,0,1,0,1,1,0,0]
=> [[1,3,5,6],[2,4,7,8]]
=> [2,4,7,8,1,3,5,6] => ([(0,7),(1,5),(1,6),(2,5),(2,6),(3,4),(3,7),(4,5),(4,6),(5,7),(6,7)],8)
=> ? = 4
[1,0,1,1,0,0,1,0]
=> [[1,3,4,7],[2,5,6,8]]
=> [2,5,6,8,1,3,4,7] => ([(0,7),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,7),(5,7),(6,7)],8)
=> ? = 4
[1,0,1,1,0,1,0,0]
=> [[1,3,4,6],[2,5,7,8]]
=> [2,5,7,8,1,3,4,6] => ([(0,7),(1,5),(1,6),(2,3),(2,4),(2,7),(3,5),(3,6),(4,5),(4,6),(5,7),(6,7)],8)
=> ? = 4
[1,0,1,1,1,0,0,0]
=> [[1,3,4,5],[2,6,7,8]]
=> [2,6,7,8,1,3,4,5] => ([(0,7),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,7),(5,7),(6,7)],8)
=> ? = 2
[1,1,0,0,1,0,1,0]
=> [[1,2,5,7],[3,4,6,8]]
=> [3,4,6,8,1,2,5,7] => ([(0,7),(1,5),(1,6),(2,5),(2,6),(3,4),(3,7),(4,5),(4,6),(5,7),(6,7)],8)
=> ? = 4
[1,1,0,0,1,1,0,0]
=> [[1,2,5,6],[3,4,7,8]]
=> [3,4,7,8,1,2,5,6] => ([(0,6),(0,7),(1,4),(1,5),(2,4),(2,5),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7)],8)
=> ? = 0
[1,1,0,1,0,0,1,0]
=> [[1,2,4,7],[3,5,6,8]]
=> [3,5,6,8,1,2,4,7] => ([(0,7),(1,5),(1,6),(2,3),(2,4),(2,7),(3,5),(3,6),(4,5),(4,6),(5,7),(6,7)],8)
=> ? = 4
[1,1,0,1,0,1,0,0]
=> [[1,2,4,6],[3,5,7,8]]
=> [3,5,7,8,1,2,4,6] => ([(0,6),(0,7),(1,4),(1,5),(2,3),(2,4),(2,5),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7)],8)
=> ? = 4
[1,1,0,1,1,0,0,0]
=> [[1,2,4,5],[3,6,7,8]]
=> [3,6,7,8,1,2,4,5] => ([(0,6),(0,7),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7)],8)
=> ? = 1
[1,1,1,0,0,0,1,0]
=> [[1,2,3,7],[4,5,6,8]]
=> [4,5,6,8,1,2,3,7] => ([(0,7),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,7),(5,7),(6,7)],8)
=> ? = 2
[1,1,1,0,0,1,0,0]
=> [[1,2,3,6],[4,5,7,8]]
=> [4,5,7,8,1,2,3,6] => ([(0,6),(0,7),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,6),(3,7),(4,6),(4,7),(5,6),(5,7)],8)
=> ? = 1
[1,1,1,0,1,0,0,0]
=> [[1,2,3,5],[4,6,7,8]]
=> [4,6,7,8,1,2,3,5] => ([(0,5),(0,6),(0,7),(1,2),(1,3),(1,4),(2,5),(2,6),(2,7),(3,5),(3,6),(3,7),(4,5),(4,6),(4,7)],8)
=> ? = 2
[1,1,1,1,0,0,0,0]
=> [[1,2,3,4],[5,6,7,8]]
=> [5,6,7,8,1,2,3,4] => ([(0,4),(0,5),(0,6),(0,7),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7)],8)
=> ? = 0
[1,0,1,0,1,0,1,0,1,0]
=> [[1,3,5,7,9],[2,4,6,8,10]]
=> [2,4,6,8,10,1,3,5,7,9] => ([(0,9),(1,8),(2,7),(2,8),(3,6),(3,9),(4,5),(4,7),(4,8),(5,6),(5,9),(6,7),(6,8),(7,9),(8,9)],10)
=> ? = 10
[1,0,1,0,1,0,1,1,0,0]
=> [[1,3,5,7,8],[2,4,6,9,10]]
=> [2,4,6,9,10,1,3,5,7,8] => ([(0,9),(1,7),(1,8),(2,7),(2,8),(3,6),(3,9),(4,5),(4,7),(4,8),(5,6),(5,9),(6,7),(6,8),(7,9),(8,9)],10)
=> ? = 6
[1,0,1,1,0,0,1,1,0,0]
=> [[1,3,4,7,8],[2,5,6,9,10]]
=> [2,5,6,9,10,1,3,4,7,8] => ([(0,9),(1,7),(1,8),(2,7),(2,8),(3,5),(3,6),(3,9),(4,5),(4,6),(4,9),(5,7),(5,8),(6,7),(6,8),(7,9),(8,9)],10)
=> ? = 2
[1,1,0,1,0,1,0,1,0,0]
=> [[1,2,4,6,8],[3,5,7,9,10]]
=> [3,5,7,9,10,1,2,4,6,8] => ([(0,8),(0,9),(1,6),(1,7),(2,5),(2,6),(2,7),(3,4),(3,8),(3,9),(4,5),(4,6),(4,7),(5,8),(5,9),(6,8),(6,9),(7,8),(7,9)],10)
=> ? = 6
[1,1,0,1,1,1,0,0,0,0]
=> [[1,2,4,5,6],[3,7,8,9,10]]
=> [3,7,8,9,10,1,2,4,5,6] => ([(0,8),(0,9),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,8),(4,9),(5,8),(5,9),(6,8),(6,9),(7,8),(7,9)],10)
=> ? = 1
[1,1,1,0,1,1,0,0,0,0]
=> [[1,2,3,5,6],[4,7,8,9,10]]
=> [4,7,8,9,10,1,2,3,5,6] => ([(0,7),(0,8),(0,9),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,7),(3,8),(3,9),(4,7),(4,8),(4,9),(5,7),(5,8),(5,9),(6,7),(6,8),(6,9)],10)
=> ? = 1
[1,1,1,1,0,0,0,1,0,0]
=> [[1,2,3,4,8],[5,6,7,9,10]]
=> [5,6,7,9,10,1,2,3,4,8] => ([(0,8),(0,9),(1,4),(1,5),(1,6),(1,7),(2,4),(2,5),(2,6),(2,7),(3,4),(3,5),(3,6),(3,7),(4,8),(4,9),(5,8),(5,9),(6,8),(6,9),(7,8),(7,9)],10)
=> ? = 1
[1,1,1,1,0,0,1,0,0,0]
=> [[1,2,3,4,7],[5,6,8,9,10]]
=> [5,6,8,9,10,1,2,3,4,7] => ([(0,7),(0,8),(0,9),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,7),(3,8),(3,9),(4,7),(4,8),(4,9),(5,7),(5,8),(5,9),(6,7),(6,8),(6,9)],10)
=> ? = 1
[1,1,1,1,1,0,0,0,0,0]
=> [[1,2,3,4,5],[6,7,8,9,10]]
=> [6,7,8,9,10,1,2,3,4,5] => ([(0,5),(0,6),(0,7),(0,8),(0,9),(1,5),(1,6),(1,7),(1,8),(1,9),(2,5),(2,6),(2,7),(2,8),(2,9),(3,5),(3,6),(3,7),(3,8),(3,9),(4,5),(4,6),(4,7),(4,8),(4,9)],10)
=> ? = 0
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [[1,3,5,7,9,11],[2,4,6,8,10,12]]
=> [2,4,6,8,10,12,1,3,5,7,9,11] => ([(0,11),(1,10),(2,9),(2,10),(3,8),(3,11),(4,7),(4,9),(4,10),(5,6),(5,8),(5,11),(6,7),(6,9),(6,10),(7,8),(7,11),(8,9),(8,10),(9,11),(10,11)],12)
=> ? = 12
Description
The number of zero columns in the nullspace of a graph.
Matching statistic: St000205
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000205: Integer partitions ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 25%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000205: Integer partitions ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 25%
Values
[1,0]
=> [1,0]
=> [1,0]
=> []
=> ? = 2
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> []
=> ? = 4
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> []
=> ? = 0
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 6
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 0
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 8
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 0
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 10
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 6
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 6
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 1
[1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> 0
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> ? = 12
Description
Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight.
Given $\lambda$ count how many ''integer partitions'' $w$ (weight) there are, such that
$P_{\lambda,w}$ is non-integral, i.e., $w$ such that the Gelfand-Tsetlin polytope $P_{\lambda,w}$ has at least one non-integral vertex.
Matching statistic: St000206
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000206: Integer partitions ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 25%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000206: Integer partitions ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 25%
Values
[1,0]
=> [1,0]
=> [1,0]
=> []
=> ? = 2
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> []
=> ? = 4
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> []
=> ? = 0
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 6
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 0
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 8
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 0
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 10
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 6
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 6
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 1
[1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> 0
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> ? = 12
Description
Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight.
Given $\lambda$ count how many ''integer compositions'' $w$ (weight) there are, such that
$P_{\lambda,w}$ is non-integral, i.e., $w$ such that the Gelfand-Tsetlin polytope $P_{\lambda,w}$ has at least one non-integral vertex.
See also [[St000205]].
Each value in this statistic is greater than or equal to corresponding value in [[St000205]].
Matching statistic: St000460
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000460: Integer partitions ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 25%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000460: Integer partitions ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 25%
Values
[1,0]
=> [1,0]
=> [1,0]
=> []
=> ? = 2 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> []
=> ? = 4 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> []
=> ? = 0 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 6 + 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 8 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 0 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 1 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 10 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 6 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 6 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 2 = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 2 = 1 + 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 2 = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> ? = 12 + 1
Description
The hook length of the last cell along the main diagonal of an integer partition.
Matching statistic: St000506
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000506: Integer partitions ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 25%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000506: Integer partitions ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 25%
Values
[1,0]
=> [1,0]
=> [1,0]
=> []
=> ? = 2 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> []
=> ? = 4 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> []
=> ? = 0 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 6 + 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 8 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 0 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 1 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 10 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 6 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 6 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 2 = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 2 = 1 + 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 2 = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> ? = 12 + 1
Description
The number of standard desarrangement tableaux of shape equal to the given partition.
A '''standard desarrangement tableau''' is a standard tableau whose first ascent is even. Here, an ascent of a standard tableau is an entry $i$ such that $i+1$ appears to the right or above $i$ in the tableau (with respect to English tableau notation).
This is also the nullity of the random-to-random operator (and the random-to-top) operator acting on the simple module of the symmetric group indexed by the given partition. See also:
* [[St000046]]: The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition
* [[St000500]]: Eigenvalues of the random-to-random operator acting on the regular representation.
Matching statistic: St000621
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000621: Integer partitions ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 25%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000621: Integer partitions ⟶ ℤResult quality: 19% ●values known / values provided: 19%●distinct values known / distinct values provided: 25%
Values
[1,0]
=> [1,0]
=> [1,0]
=> []
=> ? = 2 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> []
=> ? = 4 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> []
=> ? = 0 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 6 + 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> []
=> ? = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 8 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 0 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 4 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 1 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 10 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 6 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 6 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 2 = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 2 = 1 + 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> 2 = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> ? = 12 + 1
Description
The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even.
To be precise, this is given for a partition $\lambda \vdash n$ by the number of standard tableaux $T$ of shape $\lambda$ such that $\min\big( \operatorname{Des}(T) \cup \{n\} \big)$ is even.
This notion was used in [1, Proposition 2.3], see also [2, Theorem 1.1].
The case of an odd minimum is [[St000620]].
The following 40 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001060The distinguishing index of a graph. St001175The size of a partition minus the hook length of the base cell. St000618The number of self-evacuating tableaux of given shape. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St001498The normalised height of a Nakayama algebra with magnitude 1. St000264The girth of a graph, which is not a tree. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000456The monochromatic index of a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000070The number of antichains in a poset. St000422The energy of a graph, if it is integral. St000567The sum of the products of all pairs of parts. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000929The constant term of the character polynomial of an integer partition. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001637The number of (upper) dissectors of a poset. St001645The pebbling number of a connected graph. 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. St000454The largest eigenvalue of a graph if it is integral. St000528The height of a poset. St000706The product of the factorials of the multiplicities of an integer partition. St000907The number of maximal antichains of minimal length in a poset. St000911The number of maximal antichains of maximal size in a poset. St000912The number of maximal antichains in a poset. St000939The number of characters of the symmetric group whose value on the partition is positive. St000993The multiplicity of the largest part of an integer partition. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001343The dimension of the reduced incidence algebra of a poset. St001568The smallest positive integer that does not appear twice in the partition. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000487The length of the shortest cycle of a permutation. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph.
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!