searching the database
Your data matches 28 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: St001210
(load all 31 compositions to match this statistic)
(load all 31 compositions to match this statistic)
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001210: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001210: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 4
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
Description
Gives 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.
Matching statistic: St000444
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000444: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000444: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 3 = 2 + 1
Description
The length of the maximal rise of a Dyck path.
Matching statistic: St000392
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
Mp00131: Permutations —descent bottoms⟶ Binary words
St000392: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
Mp00131: Permutations —descent bottoms⟶ Binary words
St000392: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [2,1] => [2,1] => 1 => 1
[1,0,1,0]
=> [3,1,2] => [3,2,1] => 11 => 2
[1,1,0,0]
=> [2,3,1] => [3,1,2] => 10 => 1
[1,0,1,0,1,0]
=> [4,1,2,3] => [4,3,2,1] => 111 => 3
[1,0,1,1,0,0]
=> [3,1,4,2] => [4,2,1,3] => 110 => 2
[1,1,0,0,1,0]
=> [2,4,1,3] => [4,3,1,2] => 101 => 1
[1,1,0,1,0,0]
=> [4,3,1,2] => [4,2,3,1] => 110 => 2
[1,1,1,0,0,0]
=> [2,3,4,1] => [4,1,2,3] => 100 => 1
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [5,4,3,2,1] => 1111 => 4
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [5,3,2,1,4] => 1110 => 3
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [5,4,2,1,3] => 1101 => 2
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [5,3,4,2,1] => 1110 => 3
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [5,2,1,3,4] => 1100 => 2
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [5,4,3,1,2] => 1011 => 2
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [5,3,1,2,4] => 1010 => 1
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [5,4,2,3,1] => 1101 => 2
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [4,2,5,3,1] => 1110 => 3
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [5,2,3,1,4] => 1100 => 2
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [5,4,1,2,3] => 1001 => 1
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [5,3,4,1,2] => 1010 => 1
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [5,2,3,4,1] => 1100 => 2
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [5,1,2,3,4] => 1000 => 1
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [6,5,4,3,2,1] => 11111 => 5
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [6,4,3,2,1,5] => 11110 => 4
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [6,5,3,2,1,4] => 11101 => 3
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [6,4,5,3,2,1] => 11110 => 4
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [6,3,2,1,4,5] => 11100 => 3
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [6,5,4,2,1,3] => 11011 => 2
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [6,4,2,1,3,5] => 11010 => 2
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [6,5,3,4,2,1] => 11101 => 3
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [5,3,6,4,2,1] => 11110 => 4
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [6,3,4,2,1,5] => 11100 => 3
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [6,5,2,1,3,4] => 11001 => 2
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [6,4,5,2,1,3] => 11010 => 2
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [6,3,4,5,2,1] => 11100 => 3
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [6,2,1,3,4,5] => 11000 => 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [6,5,4,3,1,2] => 10111 => 3
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [6,4,3,1,2,5] => 10110 => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [6,5,3,1,2,4] => 10101 => 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [6,4,5,3,1,2] => 10110 => 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [6,3,1,2,4,5] => 10100 => 1
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [6,5,4,2,3,1] => 11011 => 2
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [6,4,2,3,1,5] => 11010 => 2
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [4,2,6,5,3,1] => 11101 => 3
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [5,3,1,6,4,2] => 11110 => 4
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [4,2,6,3,1,5] => 11100 => 3
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [6,5,2,3,1,4] => 11001 => 2
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [6,4,5,2,3,1] => 11010 => 2
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [5,2,4,6,3,1] => 11100 => 3
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [6,2,3,1,4,5] => 11000 => 2
Description
The length of the longest run of ones in a binary word.
Matching statistic: St000723
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000723: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000723: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => ([],1)
=> 1
[1,0,1,0]
=> [1,2] => [2] => ([],2)
=> 2
[1,1,0,0]
=> [2,1] => [1,1] => ([(0,1)],2)
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [3] => ([],3)
=> 3
[1,0,1,1,0,0]
=> [1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> 2
[1,1,0,0,1,0]
=> [2,1,3] => [1,2] => ([(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [4] => ([],4)
=> 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,3] => ([(2,3)],4)
=> 2
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [5] => ([],5)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [2,3] => ([(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,4] => ([(3,4)],5)
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [2,3] => ([(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
Description
The maximal cardinality of a set of vertices with the same neighbourhood in a graph.
The set of so called mating graphs, for which this statistic equals $1$, is enumerated by [1].
Matching statistic: St001024
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00072: Permutations —binary search tree: left to right⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St001024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00072: Permutations —binary search tree: left to right⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St001024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [1,0]
=> 1
[1,0,1,0]
=> [2,1] => [[.,.],.]
=> [1,0,1,0]
=> 2
[1,1,0,0]
=> [1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [3,2,1] => [[[.,.],.],.]
=> [1,0,1,0,1,0]
=> 3
[1,0,1,1,0,0]
=> [2,3,1] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> [3,1,2] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => [[[[.,.],.],.],.]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => [[[.,[.,.]],.],.]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => [[[[[.,.],.],.],.],.]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => [[[[.,.],.],.],[.,.]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => [[[[.,.],.],[.,.]],.]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => [[[[.,.],.],.],[.,.]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => [[[.,.],.],[.,[.,.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => [[[[.,.],[.,.]],.],.]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => [[[.,.],[.,.]],[.,.]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => [[[[.,.],.],[.,.]],.]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => [[[[.,.],.],.],[.,.]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => [[[.,.],.],[.,[.,.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => [[[.,.],[.,[.,.]]],.]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => [[[.,.],[.,.]],[.,.]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => [[[.,.],.],[.,[.,.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => [[[[.,[.,.]],.],.],.]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => [[[.,[.,.]],.],[.,.]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => [[[.,[.,.]],[.,.]],.]
=> [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => [[[.,[.,.]],.],[.,.]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => [[[[.,.],[.,.]],.],.]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => [[[.,.],[.,.]],[.,.]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => [[[[.,.],.],[.,.]],.]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => [[[[.,.],.],.],[.,.]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => [[[.,.],.],[.,[.,.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => [[[.,.],[.,[.,.]]],.]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => [[[.,.],[.,.]],[.,.]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => [[[.,.],.],[.,[.,.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2
Description
Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001652
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00137: Dyck paths —to symmetric ASM⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St001652: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St001652: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1]]
=> [1] => [1] => 1
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => [1,2] => 2
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => [2,1] => 1
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => [1,2,3] => 3
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => [2,3,1] => 2
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => [2,1,3] => 1
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => [2,3,1] => 2
[1,1,1,0,0,0]
=> [[0,0,1],[0,1,0],[1,0,0]]
=> [3,2,1] => [3,2,1] => 1
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => [1,2,3,4] => 4
[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,2,4,3] => [2,3,4,1] => 3
[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,3,2,4] => [2,3,1,4] => 2
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [2,3,4,1] => 3
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]]
=> [1,4,3,2] => [3,4,2,1] => 2
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => [2,1,3,4] => 2
[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,4,3] => [3,2,4,1] => 1
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => [2,3,1,4] => 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]]
=> [1,2,4,3] => [2,3,4,1] => 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]]
=> [1,4,3,2] => [3,4,2,1] => 2
[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,2,1,4] => [3,2,1,4] => 1
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[0,1,0,0],[1,0,-1,1],[0,0,1,0]]
=> [2,1,4,3] => [3,2,4,1] => 1
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[0,1,-1,1],[1,-1,1,0],[0,1,0,0]]
=> [1,4,3,2] => [3,4,2,1] => 2
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]
=> [4,3,2,1] => [4,3,2,1] => 1
[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]]
=> [1,2,3,4,5] => [1,2,3,4,5] => 5
[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,2,3,5,4] => [2,3,4,5,1] => 4
[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,2,4,3,5] => [2,3,4,1,5] => 3
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => [2,3,4,5,1] => 4
[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]]
=> [1,2,5,4,3] => [3,4,5,2,1] => 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,3,2,4,5] => [2,3,1,4,5] => 2
[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]]
=> [1,3,2,5,4] => [3,4,2,5,1] => 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]]
=> [1,2,4,3,5] => [2,3,4,1,5] => 3
[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]]
=> [1,2,3,5,4] => [2,3,4,5,1] => 4
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => [3,4,5,2,1] => 3
[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]]
=> [1,4,3,2,5] => [3,4,2,1,5] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [3,4,2,5,1] => 2
[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]]
=> [1,2,5,4,3] => [3,4,5,2,1] => 3
[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]]
=> [1,5,4,3,2] => [4,5,3,2,1] => 2
[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]]
=> [2,1,3,4,5] => [2,1,3,4,5] => 3
[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,3,5,4] => [3,2,4,5,1] => 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,4,3,5] => [3,2,4,1,5] => 1
[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]]
=> [2,1,3,5,4] => [3,2,4,5,1] => 2
[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]]
=> [2,1,5,4,3] => [4,3,5,2,1] => 1
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => [2,3,1,4,5] => 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]]
=> [1,3,2,5,4] => [3,4,2,5,1] => 2
[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]]
=> [1,2,4,3,5] => [2,3,4,1,5] => 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]]
=> [1,2,3,5,4] => [2,3,4,5,1] => 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]]
=> [1,2,5,4,3] => [3,4,5,2,1] => 3
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,4,3,2,5] => [3,4,2,1,5] => 2
[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]]
=> [1,3,2,5,4] => [3,4,2,5,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => [3,4,5,2,1] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,5,4,3,2] => [4,5,3,2,1] => 2
Description
The length of a longest interval of consecutive numbers.
For a permutation $\pi=\pi_1,\dots,\pi_n$, this statistic returns the length of a longest subsequence $\pi_k,\dots,\pi_\ell$ such that $\pi_{i+1} = \pi_i + 1$ for $i\in\{k,\dots,\ell-1\}$.
Matching statistic: St001662
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St001662: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St001662: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [[1]]
=> [1] => 1
[1,0,1,0]
=> [1,2] => [[1,2]]
=> [1,2] => 2
[1,1,0,0]
=> [2,1] => [[1],[2]]
=> [2,1] => 1
[1,0,1,0,1,0]
=> [1,2,3] => [[1,2,3]]
=> [1,2,3] => 3
[1,0,1,1,0,0]
=> [1,3,2] => [[1,2],[3]]
=> [3,1,2] => 2
[1,1,0,0,1,0]
=> [2,1,3] => [[1,3],[2]]
=> [2,1,3] => 1
[1,1,0,1,0,0]
=> [2,3,1] => [[1,2],[3]]
=> [3,1,2] => 2
[1,1,1,0,0,0]
=> [3,2,1] => [[1],[2],[3]]
=> [3,2,1] => 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [[1,2,3,4]]
=> [1,2,3,4] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [[1,2,3],[4]]
=> [4,1,2,3] => 3
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [[1,2,4],[3]]
=> [3,1,2,4] => 2
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [[1,2,3],[4]]
=> [4,1,2,3] => 3
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [[1,2],[3],[4]]
=> [4,3,1,2] => 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [[1,3,4],[2]]
=> [2,1,3,4] => 2
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [[1,3],[2,4]]
=> [2,4,1,3] => 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [[1,2,4],[3]]
=> [3,1,2,4] => 2
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[1,2,3],[4]]
=> [4,1,2,3] => 3
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [[1,2],[3],[4]]
=> [4,3,1,2] => 2
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [[1,4],[2],[3]]
=> [3,2,1,4] => 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [[1,3],[2],[4]]
=> [4,2,1,3] => 1
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [[1,2],[3],[4]]
=> [4,3,1,2] => 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [[1],[2],[3],[4]]
=> [4,3,2,1] => 1
[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] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [[1,2,3,4],[5]]
=> [5,1,2,3,4] => 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [[1,2,3,5],[4]]
=> [4,1,2,3,5] => 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [[1,2,3,4],[5]]
=> [5,1,2,3,4] => 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [[1,2,4,5],[3]]
=> [3,1,2,4,5] => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [[1,2,4],[3,5]]
=> [3,5,1,2,4] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [[1,2,3,5],[4]]
=> [4,1,2,3,5] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [[1,2,3,4],[5]]
=> [5,1,2,3,4] => 4
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [[1,2,5],[3],[4]]
=> [4,3,1,2,5] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [[1,2,4],[3],[5]]
=> [5,3,1,2,4] => 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [[1,2],[3],[4],[5]]
=> [5,4,3,1,2] => 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [[1,3,4,5],[2]]
=> [2,1,3,4,5] => 3
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [[1,3,4],[2,5]]
=> [2,5,1,3,4] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [[1,3,5],[2,4]]
=> [2,4,1,3,5] => 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [[1,3,4],[2,5]]
=> [2,5,1,3,4] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [[1,3],[2,4],[5]]
=> [5,2,4,1,3] => 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [[1,2,4,5],[3]]
=> [3,1,2,4,5] => 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [[1,2,4],[3,5]]
=> [3,5,1,2,4] => 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [[1,2,3,5],[4]]
=> [4,1,2,3,5] => 3
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [[1,2,3,4],[5]]
=> [5,1,2,3,4] => 4
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => 3
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [[1,2,5],[3],[4]]
=> [4,3,1,2,5] => 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [[1,2,4],[3],[5]]
=> [5,3,1,2,4] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [[1,2],[3],[4],[5]]
=> [5,4,3,1,2] => 2
Description
The length of the longest factor of consecutive numbers in a permutation.
Matching statistic: St000381
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00102: Dyck paths —rise composition⟶ Integer compositions
St000381: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00102: Dyck paths —rise composition⟶ Integer compositions
St000381: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,1,0,0]
=> [2] => 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [3] => 3 = 2 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,1] => 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => 4 = 3 + 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5] => 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1] => 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2] => 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,1] => 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,1,1] => 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,3] => 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [3,2] => 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,1] => 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,1,1] => 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [3,1,1] => 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [6] => 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [5,1] => 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [4,2] => 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [5,1] => 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [4,1,1] => 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [3,3] => 3 = 2 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [3,2,1] => 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [4,2] => 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [5,1] => 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [4,1,1] => 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [3,1,2] => 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [3,2,1] => 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [4,1,1] => 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [3,1,1,1] => 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [2,4] => 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [2,3,1] => 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [2,2,2] => 2 = 1 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [2,3,1] => 3 = 2 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [2,2,1,1] => 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [3,3] => 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [3,2,1] => 3 = 2 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [4,2] => 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [5,1] => 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [4,1,1] => 4 = 3 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [3,1,2] => 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [3,2,1] => 3 = 2 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [4,1,1] => 4 = 3 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [3,1,1,1] => 3 = 2 + 1
Description
The largest part of an integer composition.
Matching statistic: St000969
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00072: Permutations —binary search tree: left to right⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000969: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00072: Permutations —binary search tree: left to right⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000969: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [.,.]
=> [1,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [2,1] => [[.,.],.]
=> [1,0,1,0]
=> 3 = 2 + 1
[1,1,0,0]
=> [1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [3,2,1] => [[[.,.],.],.]
=> [1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,0]
=> [2,3,1] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [3,1,2] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => [[[[.,.],.],.],.]
=> [1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => [[[.,[.,.]],.],.]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => [[[[[.,.],.],.],.],.]
=> [1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => [[[[.,.],.],.],[.,.]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => [[[[.,.],.],[.,.]],.]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => [[[[.,.],.],.],[.,.]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => [[[.,.],.],[.,[.,.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => [[[[.,.],[.,.]],.],.]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => [[[.,.],[.,.]],[.,.]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => [[[[.,.],.],[.,.]],.]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => [[[[.,.],.],.],[.,.]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => [[[.,.],.],[.,[.,.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => [[[.,.],[.,[.,.]]],.]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => [[[.,.],[.,.]],[.,.]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => [[[.,.],.],[.,[.,.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => [[[[.,[.,.]],.],.],.]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => [[[.,[.,.]],.],[.,.]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => [[[.,[.,.]],[.,.]],.]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => [[[.,[.,.]],.],[.,.]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => [[[[.,.],[.,.]],.],.]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => [[[.,.],[.,.]],[.,.]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => [[[[.,.],.],[.,.]],.]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => [[[[.,.],.],.],[.,.]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => [[[.,.],.],[.,[.,.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => [[[.,.],[.,[.,.]]],.]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => [[[.,.],[.,.]],[.,.]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => [[[.,.],.],[.,[.,.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3 = 2 + 1
Description
We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. Then we calculate the global dimension of that CNakayama algebra.
Matching statistic: St001062
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St001062: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St001062: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,1,0,0]
=> {{1,2}}
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> {{1,2,3}}
=> 3 = 2 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> {{1,3},{2}}
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 4 = 3 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> {{1,2,3,4,5}}
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> {{1,2,3,5},{4}}
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> {{1,2,5},{3,4}}
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> {{1,2,4,5},{3}}
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> {{1,2,5},{3},{4}}
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> {{1,5},{2,3,4}}
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> {{1,5},{2,4},{3}}
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> {{1,4,5},{2,3}}
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> {{1,5},{2,3},{4}}
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> {{1,5},{2},{3},{4}}
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> {{1,2,3,4,5,6}}
=> 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> {{1,2,3,4,6},{5}}
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> {{1,2,3,6},{4,5}}
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> {{1,2,3,5,6},{4}}
=> 5 = 4 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> {{1,2,3,6},{4},{5}}
=> 4 = 3 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> {{1,2,6},{3,4,5}}
=> 3 = 2 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> {{1,2,6},{3,5},{4}}
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> {{1,2,5,6},{3,4}}
=> 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> {{1,2,4,5,6},{3}}
=> 5 = 4 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> {{1,2,4,6},{3},{5}}
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> {{1,2,6},{3,4},{5}}
=> 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> {{1,2,6},{3},{4,5}}
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> {{1,2,5,6},{3},{4}}
=> 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> {{1,2,6},{3},{4},{5}}
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> {{1,6},{2,3,4,5}}
=> 4 = 3 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> {{1,6},{2,3,5},{4}}
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> {{1,6},{2,5},{3,4}}
=> 2 = 1 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> {{1,6},{2,4,5},{3}}
=> 3 = 2 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> {{1,6},{2,5},{3},{4}}
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> {{1,5,6},{2,3,4}}
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> {{1,5,6},{2,4},{3}}
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> {{1,4,5,6},{2,3}}
=> 4 = 3 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> {{1,3,4,5,6},{2}}
=> 5 = 4 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> {{1,3,4,6},{2},{5}}
=> 4 = 3 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> {{1,4,6},{2,3},{5}}
=> 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> {{1,3,6},{2},{4,5}}
=> 3 = 2 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> {{1,3,5,6},{2},{4}}
=> 4 = 3 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> {{1,3,6},{2},{4},{5}}
=> 3 = 2 + 1
Description
The maximal size of a block of a set partition.
The following 18 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000308The height of the tree associated to a permutation. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001372The length of a longest cyclic run of ones of a binary word. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000731The number of double exceedences of a permutation. St000982The length of the longest constant subword. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001948The number of augmented double ascents of a permutation. St000314The number of left-to-right-maxima of a permutation. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St000932The number of occurrences of the pattern UDU in a Dyck path. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001621The number of atoms of a lattice. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L.
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!