searching the database
Your data matches 275 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: St001725
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St001725: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00160: Permutations —graph of inversions⟶ Graphs
St001725: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,0]
=> [2,1] => ([(0,1)],2)
=> 2
[1,0,1,1,0,0]
=> [1,3,2] => ([(1,2)],3)
=> 2
[1,1,0,0,1,0]
=> [2,1,3] => ([(1,2)],3)
=> 2
[1,1,0,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 3
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 2
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => ([(2,3)],4)
=> 2
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 2
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 3
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 5
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => ([(4,5)],6)
=> 2
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => ([(4,5)],6)
=> 2
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => ([(3,5),(4,5)],6)
=> 3
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => ([(4,5)],6)
=> 2
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => ([(2,5),(3,4)],6)
=> 3
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => ([(3,5),(4,5)],6)
=> 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => ([(2,5),(3,5),(4,5)],6)
=> 4
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,3,2,4,5,6] => ([(4,5)],6)
=> 2
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => ([(2,5),(3,4)],6)
=> 3
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => ([(2,5),(3,4)],6)
=> 3
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => ([(1,2),(3,5),(4,5)],6)
=> 3
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => ([(3,5),(4,5)],6)
=> 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => ([(1,2),(3,5),(4,5)],6)
=> 3
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => ([(2,5),(3,5),(4,5)],6)
=> 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 5
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => ([(4,5)],6)
=> 2
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => ([(2,5),(3,4)],6)
=> 3
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => ([(2,5),(3,4)],6)
=> 3
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => ([(1,2),(3,5),(4,5)],6)
=> 3
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => ([(2,5),(3,4)],6)
=> 3
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [2,1,4,5,3,6] => ([(1,2),(3,5),(4,5)],6)
=> 3
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => ([(3,5),(4,5)],6)
=> 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => ([(1,2),(3,5),(4,5)],6)
=> 3
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,6] => ([(1,2),(3,5),(4,5)],6)
=> 3
Description
The harmonious chromatic number of a graph.
A harmonious colouring is a proper vertex colouring such that any pair of colours appears at most once on adjacent vertices.
Matching statistic: St000213
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00223: Permutations —runsort⟶ Permutations
St000213: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00223: Permutations —runsort⟶ Permutations
St000213: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => [1,2] => 2
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => [1,3,2] => 2
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => 2
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => 3
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,4,2,3] => 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,4,2,3] => 2
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,2,4,3] => 3
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,4,2,3] => 2
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => 3
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => 3
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [1,2,3,4] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => [1,5,2,3,4] => 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => [1,5,2,3,4] => 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => [1,2,5,3,4] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,5,2,3,4] => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,4,2,3,5] => 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2,5,4,1] => [1,2,5,3,4] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,3,5,2,1] => [1,2,3,5,4] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,5,2,3,4] => 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,4,2,5,3] => 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,4,2,3,5] => 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,5,2,4,3] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [3,5,4,2,1] => [1,2,3,5,4] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,5,3,2,1] => [1,2,3,4,5] => 5
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [5,4,3,2,1,6] => [1,6,2,3,4,5] => 2
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [4,3,2,1,6,5] => [1,6,2,3,4,5] => 2
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [5,4,3,2,6,1] => [1,2,6,3,4,5] => 3
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,2,1,6,5,4] => [1,6,2,3,4,5] => 2
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [3,2,1,5,4,6] => [1,5,2,3,4,6] => 3
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [4,3,2,6,5,1] => [1,2,6,3,4,5] => 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [5,4,3,6,2,1] => [1,2,3,6,4,5] => 4
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,1,6,5,4,3] => [1,6,2,3,4,5] => 2
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [2,1,5,4,3,6] => [1,5,2,3,6,4] => 3
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,6,5] => [1,4,2,3,6,5] => 3
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> [2,1,5,4,6,3] => [1,5,2,3,4,6] => 3
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [3,2,6,5,4,1] => [1,2,6,3,4,5] => 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> [3,2,5,4,1,6] => [1,6,2,5,3,4] => 3
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [4,3,6,5,2,1] => [1,2,3,6,4,5] => 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [5,4,6,3,2,1] => [1,2,3,4,6,5] => 5
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,6,5,4,3,2] => [1,6,2,3,4,5] => 2
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,5,4,3,2,6] => [1,5,2,6,3,4] => 3
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,4,3,2,6,5] => [1,4,2,6,3,5] => 3
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,5,4,3,6,2] => [1,5,2,3,6,4] => 3
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,6,5,4] => [1,3,2,6,4,5] => 3
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,4,3,6,5,2] => [1,4,2,3,6,5] => 3
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [2,6,5,4,3,1] => [1,2,6,3,4,5] => 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [2,5,4,3,1,6] => [1,6,2,5,3,4] => 3
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [2,4,3,1,6,5] => [1,6,2,4,3,5] => 3
Description
The number of weak exceedances (also weak excedences) of a permutation.
This is defined as
$$\operatorname{wex}(\sigma)=\#\{i:\sigma(i) \geq i\}.$$
The number of weak exceedances is given by the number of exceedances (see [[St000155]]) plus the number of fixed points (see [[St000022]]) of $\sigma$.
Matching statistic: St000451
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00149: Permutations —Lehmer code rotation⟶ Permutations
St000451: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00149: Permutations —Lehmer code rotation⟶ Permutations
St000451: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,0]
=> [1,1,0,0]
=> [1,2] => [2,1] => 2
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [2,1,3] => [3,2,1] => 2
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [3,1,2] => [1,3,2] => 2
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [2,3,1] => [3,1,2] => 3
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [3,2,1,4] => [4,3,2,1] => 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [4,2,1,3] => [1,4,3,2] => 2
[1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [3,2,4,1] => [4,3,1,2] => 3
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [4,3,1,2] => [1,2,4,3] => 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1,2,4] => [4,2,3,1] => 3
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [4,2,3,1] => [1,4,2,3] => 3
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => [4,1,2,3] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => [5,4,3,2,1] => 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => [1,5,4,3,2] => 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => [5,4,3,1,2] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => [1,2,5,4,3] => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,2,1,3,5] => [5,3,2,4,1] => 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => [1,5,4,2,3] => 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => [5,4,1,2,3] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => [1,2,3,5,4] => 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [4,3,1,2,5] => [5,4,2,3,1] => 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,2,4] => [1,5,3,4,2] => 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => [5,4,1,3,2] => 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => [1,2,5,3,4] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => [5,3,4,2,1] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => [1,5,2,3,4] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => [5,1,2,3,4] => 5
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [5,4,3,2,1,6] => [6,5,4,3,2,1] => 2
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,1,5] => [1,6,5,4,3,2] => 2
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [5,4,3,2,6,1] => [6,5,4,3,1,2] => 3
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,1,4] => [1,2,6,5,4,3] => 2
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [5,3,2,1,4,6] => [6,4,3,2,5,1] => 3
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,5,1] => [1,6,5,4,2,3] => 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [5,4,3,6,2,1] => [6,5,4,1,2,3] => 4
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,1,3] => [1,2,3,6,5,4] => 2
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [5,4,2,1,3,6] => [6,5,3,2,4,1] => 3
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [6,4,2,1,3,5] => [1,6,4,3,5,2] => 3
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [5,4,2,3,6,1] => [6,5,3,4,1,2] => 3
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,4,1] => [1,2,6,5,3,4] => 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [5,3,2,4,1,6] => [6,4,3,5,2,1] => 3
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,2,1] => [1,6,5,2,3,4] => 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,2,1] => [6,5,1,2,3,4] => 5
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,2] => [1,2,3,4,6,5] => 2
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [5,4,3,1,2,6] => [6,5,4,2,3,1] => 3
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [6,4,3,1,2,5] => [1,6,5,3,4,2] => 3
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> [5,4,3,6,1,2] => [6,5,4,1,3,2] => 3
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [6,5,3,1,2,4] => [1,2,6,4,5,3] => 3
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> [6,4,3,5,1,2] => [1,6,5,2,4,3] => 3
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,3,1] => [1,2,3,6,4,5] => 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [5,4,2,3,1,6] => [6,5,3,4,2,1] => 3
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> [6,4,2,3,1,5] => [1,6,4,5,3,2] => 3
Description
The length of the longest pattern of the form k 1 2...(k-1).
Matching statistic: St000717
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00001: Alternating sign matrices —to semistandard tableau via monotone triangles⟶ Semistandard tableaux
Mp00214: Semistandard tableaux —subcrystal⟶ Posets
St000717: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00001: Alternating sign matrices —to semistandard tableau via monotone triangles⟶ Semistandard tableaux
Mp00214: Semistandard tableaux —subcrystal⟶ Posets
St000717: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,0]
=> [[0,1],[1,0]]
=> [[1,2],[2]]
=> ([(0,1)],2)
=> 2
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 2
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [[1,1,2],[2,3],[3]]
=> ([(0,2),(2,1)],3)
=> 3
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [[1,1,1,1],[2,2,2],[3,4],[4]]
=> ([(0,1)],2)
=> 2
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [[1,1,1,1],[2,2,3],[3,3],[4]]
=> ([(0,1)],2)
=> 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,1,1,1],[2,2,3],[3,4],[4]]
=> ([(0,2),(2,1)],3)
=> 3
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [[1,1,1,2],[2,2,2],[3,3],[4]]
=> ([(0,1)],2)
=> 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]]
=> [[1,1,1,2],[2,2,2],[3,4],[4]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [[1,1,1,2],[2,2,3],[3,3],[4]]
=> ([(0,2),(2,1)],3)
=> 3
[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,1,1,2],[2,2,3],[3,4],[4]]
=> ([(0,3),(2,1),(3,2)],4)
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [[1,1,1,1,1],[2,2,2,2],[3,3,3],[4,5],[5]]
=> ([(0,1)],2)
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [[1,1,1,1,1],[2,2,2,2],[3,3,4],[4,4],[5]]
=> ([(0,1)],2)
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[1,1,1,1,1],[2,2,2,2],[3,3,4],[4,5],[5]]
=> ([(0,2),(2,1)],3)
=> 3
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [[1,1,1,1,1],[2,2,2,3],[3,3,3],[4,4],[5]]
=> ([(0,1)],2)
=> 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,1,1,1,1],[2,2,2,3],[3,3,3],[4,5],[5]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [[1,1,1,1,1],[2,2,2,3],[3,3,4],[4,4],[5]]
=> ([(0,2),(2,1)],3)
=> 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,1,1,1,1],[2,2,2,3],[3,3,4],[4,5],[5]]
=> ([(0,3),(2,1),(3,2)],4)
=> 4
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [[1,1,1,1,2],[2,2,2,2],[3,3,3],[4,4],[5]]
=> ([(0,1)],2)
=> 2
[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]]
=> [[1,1,1,1,2],[2,2,2,2],[3,3,3],[4,5],[5]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[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]]
=> [[1,1,1,1,2],[2,2,2,2],[3,3,4],[4,4],[5]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[1,1,1,1,2],[2,2,2,2],[3,3,4],[4,5],[5]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [[1,1,1,1,2],[2,2,2,3],[3,3,3],[4,4],[5]]
=> ([(0,2),(2,1)],3)
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [[1,1,1,1,2],[2,2,2,3],[3,3,3],[4,5],[5]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [[1,1,1,1,2],[2,2,2,3],[3,3,4],[4,4],[5]]
=> ([(0,3),(2,1),(3,2)],4)
=> 4
[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,1,1,1,2],[2,2,2,3],[3,3,4],[4,5],[5]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,3],[4,4,4],[5,6],[6]]
=> ([(0,1)],2)
=> 2
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,3],[4,4,5],[5,5],[6]]
=> ([(0,1)],2)
=> 2
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,3],[4,4,5],[5,6],[6]]
=> ([(0,2),(2,1)],3)
=> 3
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,4],[4,4,4],[5,5],[6]]
=> ([(0,1)],2)
=> 2
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,4],[4,4,4],[5,6],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,4],[4,4,5],[5,5],[6]]
=> ([(0,2),(2,1)],3)
=> 3
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,2],[3,3,3,4],[4,4,5],[5,6],[6]]
=> ([(0,3),(2,1),(3,2)],4)
=> 4
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,3],[4,4,4],[5,5],[6]]
=> ([(0,1)],2)
=> 2
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,3],[4,4,4],[5,6],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,3],[4,4,5],[5,5],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,3],[4,4,5],[5,6],[6]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,4],[4,4,4],[5,5],[6]]
=> ([(0,2),(2,1)],3)
=> 3
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,4],[4,4,4],[5,6],[6]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,4],[4,4,5],[5,5],[6]]
=> ([(0,3),(2,1),(3,2)],4)
=> 4
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [[1,0,0,0,0,0],[0,0,1,0,0,0],[0,1,-1,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,1],[2,2,2,2,3],[3,3,3,4],[4,4,5],[5,6],[6]]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,2],[2,2,2,2,2],[3,3,3,3],[4,4,4],[5,5],[6]]
=> ([(0,1)],2)
=> 2
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,2],[2,2,2,2,2],[3,3,3,3],[4,4,4],[5,6],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,2],[2,2,2,2,2],[3,3,3,3],[4,4,5],[5,5],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,1,-1,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,2],[2,2,2,2,2],[3,3,3,3],[4,4,5],[5,6],[6]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,2],[2,2,2,2,2],[3,3,3,4],[4,4,4],[5,5],[6]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,0,1,0,0],[0,0,1,-1,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,2],[2,2,2,2,2],[3,3,3,4],[4,4,5],[5,5],[6]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0,0],[1,-1,1,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,2],[2,2,2,2,3],[3,3,3,3],[4,4,4],[5,5],[6]]
=> ([(0,2),(2,1)],3)
=> 3
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0,0],[1,-1,1,0,0,0],[0,1,0,0,0,0],[0,0,0,1,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [[1,1,1,1,1,2],[2,2,2,2,3],[3,3,3,3],[4,4,4],[5,6],[6]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0,0],[1,-1,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [[1,1,1,1,1,2],[2,2,2,2,3],[3,3,3,3],[4,4,5],[5,5],[6]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3
Description
The number of ordinal summands of a poset.
The ordinal sum of two posets $P$ and $Q$ is the poset having elements $(p,0)$ and $(q,1)$ for $p\in P$ and $q\in Q$, and relations $(a,0) < (b,0)$ if $a < b$ in $P$, $(a,1) < (b,1)$ if $a < b$ in $Q$, and $(a,0) < (b,1)$.
This statistic is the length of the longest ordinal decomposition of a poset.
Matching statistic: St000744
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00108: Permutations —cycle type⟶ Integer partitions
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
St000744: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00108: Permutations —cycle type⟶ Integer partitions
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
St000744: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,0]
=> [2,1] => [2]
=> [[1,2]]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [2,1]
=> [[1,3],[2]]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1]
=> [[1,3],[2]]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [3]
=> [[1,2,3]]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [2,1,1]
=> [[1,4],[2],[3]]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,1,1]
=> [[1,4],[2],[3]]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1]
=> [[1,3,4],[2]]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,1]
=> [[1,4],[2],[3]]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,2]
=> [[1,2],[3,4]]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1]
=> [[1,3,4],[2]]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4]
=> [[1,2,3,4]]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [3,1,1]
=> [[1,4,5],[2],[3]]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [2,2,1]
=> [[1,3],[2,5],[4]]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,1,1]
=> [[1,4,5],[2],[3]]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [4,1]
=> [[1,3,4,5],[2]]
=> 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,2,1]
=> [[1,3],[2,5],[4]]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,2,1]
=> [[1,3],[2,5],[4]]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,2]
=> [[1,2,5],[3,4]]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,1]
=> [[1,4,5],[2],[3]]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2]
=> [[1,2,5],[3,4]]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1]
=> [[1,3,4,5],[2]]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5]
=> [[1,2,3,4,5]]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => [2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => [2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => [3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => [2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => [2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => [3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => [4,1,1]
=> [[1,4,5,6],[2],[3]]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,3,2,4,5,6] => [2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => [2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => [2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => [3,2,1]
=> [[1,3,6],[2,5],[4]]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => [3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => [3,2,1]
=> [[1,3,6],[2,5],[4]]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => [4,1,1]
=> [[1,4,5,6],[2],[3]]
=> 3 = 4 - 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => [5,1]
=> [[1,3,4,5,6],[2]]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => [2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => [2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => [2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => [3,2,1]
=> [[1,3,6],[2,5],[4]]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => [2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [2,1,4,5,3,6] => [3,2,1]
=> [[1,3,6],[2,5],[4]]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => [3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => [3,2,1]
=> [[1,3,6],[2,5],[4]]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,6] => [3,2,1]
=> [[1,3,6],[2,5],[4]]
=> 2 = 3 - 1
Description
The length of the path to the largest entry in a standard Young tableau.
Matching statistic: St000773
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000773: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000773: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,0]
=> [2,1] => [2,1] => ([(0,1)],2)
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => ([(1,2)],3)
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => ([(1,2)],3)
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => ([(2,3)],4)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => ([(2,3)],4)
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => ([(2,3)],4)
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => ([(0,3),(1,2)],4)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => ([(3,4)],5)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => ([(3,4)],5)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => ([(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => ([(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => ([(0,1),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => ([(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => ([(0,1),(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => [1,2,3,4,6,5] => ([(4,5)],6)
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => [1,2,3,5,4,6] => ([(4,5)],6)
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => [1,2,3,6,5,4] => ([(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => [1,2,4,3,5,6] => ([(4,5)],6)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,2,4,3,6,5] => [1,2,4,3,6,5] => ([(2,5),(3,4)],6)
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => [1,2,5,4,3,6] => ([(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => [1,2,6,5,4,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,3,2,4,5,6] => [1,3,2,4,5,6] => ([(4,5)],6)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => [1,3,2,4,6,5] => ([(2,5),(3,4)],6)
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4,6] => [1,3,2,5,4,6] => ([(2,5),(3,4)],6)
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,3,2,5,6,4] => [1,3,2,6,5,4] => ([(1,2),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => [1,4,3,2,5,6] => ([(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,3,4,2,6,5] => [1,4,3,2,6,5] => ([(1,2),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => [1,5,4,3,2,6] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 4 - 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => [1,6,5,4,3,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 5 - 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => [2,1,3,4,5,6] => ([(4,5)],6)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => [2,1,3,4,6,5] => ([(2,5),(3,4)],6)
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => [2,1,3,5,4,6] => ([(2,5),(3,4)],6)
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => [2,1,3,6,5,4] => ([(1,2),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => [2,1,4,3,5,6] => ([(2,5),(3,4)],6)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [2,1,4,5,3,6] => [2,1,5,4,3,6] => ([(1,2),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => [3,2,1,4,5,6] => ([(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => [3,2,1,4,6,5] => ([(1,2),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,6] => [3,2,1,5,4,6] => ([(1,2),(3,4),(3,5),(4,5)],6)
=> 2 = 3 - 1
Description
The multiplicity of the largest Laplacian eigenvalue in a graph.
Matching statistic: St000845
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St000845: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St000845: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(1,2)],3)
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,1),(0,2)],3)
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(1,3),(3,2)],4)
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(3,1),(3,2)],4)
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(3,1)],4)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ([(0,3),(3,4),(4,1),(4,2)],5)
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> ([(0,4),(1,4),(2,4),(4,3)],5)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(4,2),(4,3)],5)
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ([(0,4),(4,1),(4,2),(4,3)],5)
=> 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(3,2),(4,1),(4,3)],5)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3),(0,4)],5)
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> ([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> ([(0,5),(1,5),(2,5),(3,4),(5,3)],6)
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(1,4),(2,4),(2,5),(3,1),(3,5)],6)
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> ([(0,5),(1,5),(4,2),(4,3),(5,4)],6)
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> ([(0,4),(4,5),(5,1),(5,2),(5,3)],6)
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0,1,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]
=> ([(0,5),(1,5),(2,5),(3,5),(5,4)],6)
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,5),(3,1),(3,5),(4,2),(4,3)],6)
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(0,5),(1,4),(1,5),(4,3),(5,2),(5,3)],6)
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> ([(0,5),(4,2),(4,3),(5,1),(5,4)],6)
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> ([(0,5),(1,5),(2,5),(5,3),(5,4)],6)
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> ([(0,5),(1,5),(5,2),(5,3),(5,4)],6)
=> 3 = 4 - 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> ([(0,5),(5,1),(5,2),(5,3),(5,4)],6)
=> 4 = 5 - 1
[1,1,0,0,1,0,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]
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> ([(0,4),(3,2),(4,5),(5,1),(5,3)],6)
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> ([(0,5),(1,5),(4,2),(5,3),(5,4)],6)
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(5,3)],6)
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(2,5),(3,5),(4,2),(4,3)],6)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(4,2),(5,3)],6)
=> 2 = 3 - 1
Description
The maximal number of elements covered by an element in a poset.
Matching statistic: St001194
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001194: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001194: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [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]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,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]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0,1,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]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,1,0,0,1,0,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]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0,1,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]
=> 2 = 3 - 1
Description
The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module
Matching statistic: St001498
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001498: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001498: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [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 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1 = 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,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 3 = 4 - 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,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 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,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,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]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,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]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 2 = 3 - 1
Description
The normalised height of a Nakayama algebra with magnitude 1.
We use the bijection (see code) suggested by Christian Stump, to have a bijection between such Nakayama algebras with magnitude 1 and Dyck paths. The normalised height is the height of the (periodic) Dyck path given by the top of the Auslander-Reiten quiver. Thus when having a CNakayama algebra it is the Loewy length minus the number of simple modules and for the LNakayama algebras it is the usual height.
Matching statistic: St001499
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001499: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001499: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2 = 3 - 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,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2 = 3 - 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,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> 2 = 3 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,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]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> 2 = 3 - 1
Description
The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra.
We use the bijection in the code by Christian Stump to have a bijection to Dyck paths.
The following 265 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St000741The Colin de Verdière graph invariant. St000617The number of global maxima of a Dyck path. St001118The acyclic chromatic index of a graph. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001115The number of even descents of a permutation. St001180Number of indecomposable injective modules with projective dimension at most 1. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001960The number of descents of a permutation minus one if its first entry is not one. St001330The hat guessing number of a graph. St000456The monochromatic index of a connected graph. St000896The number of zeros on the main diagonal of an alternating sign matrix. St001769The reflection length of a signed permutation. St001861The number of Bruhat lower covers of a permutation. St001864The number of excedances of a signed permutation. St001894The depth of a signed permutation. St000264The girth of a graph, which is not a tree. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St001875The number of simple modules with projective dimension at most 1. St000477The weight of a partition according to Alladi. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000668The least common multiple of the parts of the partition. St000706The product of the factorials of the multiplicities of an integer partition. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000927The alternating sum of the coefficients of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. 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. St000997The even-odd crank of an integer partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The 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 vertex labelled trees. St001568The smallest positive integer that does not appear twice in the partition. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001862The number of crossings of a signed permutation. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001896The number of right descents of a signed permutations. St000284The Plancherel distribution on integer partitions. St000478Another weight of a partition according to Alladi. St000509The diagonal index (content) of a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. 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. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000681The Grundy value of Chomp on Ferrers diagrams. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000929The constant term of the character polynomial of an integer partition. St000934The 2-degree 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. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001128The exponens consonantiae of a partition. St001866The nesting alignments of a signed permutation. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000455The second largest eigenvalue of a graph if it is integral. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000928The sum of the coefficients of the character polynomial of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000716The dimension of the irreducible representation of Sp(6) labelled by an integer partition. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000703The number of deficiencies of a permutation. St000260The radius of a connected graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001596The number of two-by-two squares inside a skew partition. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001435The number of missing boxes in the first row. St000883The number of longest increasing subsequences of a permutation. St000390The number of runs of ones in a binary word. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000389The number of runs of ones of odd length in a binary word. St001394The genus of a permutation. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St001651The Frankl number of a lattice. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001267The length of the Lyndon factorization of the binary word. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000746The number of pairs with odd minimum in a perfect matching. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001462The number of factors of a standard tableaux under concatenation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000136The dinv of a parking function. St000194The number of primary dinversion pairs of a labelled dyck path corresponding to a parking function. St001712The number of natural descents of a standard Young tableau. St001821The sorting index of a signed permutation. St001414Half the length of the longest odd length palindromic prefix of a binary word. St000015The number of peaks of a Dyck path. St000155The number of exceedances (also excedences) of a permutation. 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. St000216The absolute length of a permutation. St000241The number of cyclical small excedances. St000331The number of upper interactions of a Dyck path. St000670The reversal length of a permutation. St000702The number of weak deficiencies of a permutation. St000710The number of big deficiencies of a permutation. St000740The last entry of a permutation. St000742The number of big ascents of a permutation after prepending zero. St000809The reduced reflection length of the permutation. St000834The number of right outer peaks of a permutation. St000942The number of critical left to right maxima of the parking functions. St000991The number of right-to-left minima of a permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001152The number of pairs with even minimum in a perfect matching. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001415The length of the longest palindromic prefix of a binary word. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001589The nesting number of a perfect matching. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000018The number of inversions of a permutation. St000019The cardinality of the support of a permutation. St000022The number of fixed points of a permutation. St000035The number of left outer peaks of a permutation. St000039The number of crossings of a permutation. St000052The number of valleys of a Dyck path not on the x-axis. St000119The number of occurrences of the pattern 321 in a permutation. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000133The "bounce" of a permutation. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000223The number of nestings in the permutation. St000232The number of crossings of a set partition. St000236The number of cyclical small weak excedances. St000237The number of small exceedances. St000239The number of small weak excedances. St000356The number of occurrences of the pattern 13-2. St000359The number of occurrences of the pattern 23-1. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000443The number of long tunnels of a Dyck path. St000463The number of admissible inversions of a permutation. St000647The number of big descents of a permutation. St000648The number of 2-excedences of a permutation. St000649The number of 3-excedences of a permutation. St000653The last descent of a permutation. St000676The number of odd rises of a Dyck path. St000731The number of double exceedences of a permutation. St000820The number of compositions obtained by rotating the composition. St000840The number of closers smaller than the largest opener in a perfect matching. St000872The number of very big descents of a permutation. St000884The number of isolated descents of a permutation. St000894The trace of an alternating sign matrix. St000911The number of maximal antichains of maximal size in a poset. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001153The number of blocks with even minimum in a set partition. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. 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)$. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules 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. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001433The flag major index of a signed permutation. St001437The flex of a binary word. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001497The position of the largest weak excedence of a permutation. St001513The number of nested exceedences of a permutation. St001557The number of inversions of the second entry of a permutation. St001768The number of reduced words of a signed permutation. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001811The Castelnuovo-Mumford regularity of a permutation. St001822The number of alignments of a signed permutation. St001823The Stasinski-Voll length of a signed permutation. St001835The number of occurrences of a 231 pattern in the restricted growth word of a perfect matching. St001837The number of occurrences of a 312 pattern in the restricted growth word of a perfect matching. St001892The flag excedance statistic of a signed permutation. St001904The length of the initial strictly increasing segment of a parking function. St001905The number of preferred parking spots in a parking function less than the index of the car. St001935The number of ascents in a parking function. St001937The size of the center of a parking function. St001946The number of descents in a parking function. St001948The number of augmented double ascents of a permutation. St000516The number of stretching pairs of a permutation. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001520The number of strict 3-descents. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001060The distinguishing index of a graph. St001820The size of the image of the pop stack sorting operator. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000454The largest eigenvalue of a graph if it is integral. St000031The number of cycles in the cycle decomposition of a permutation. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000259The diameter of a connected graph. St000534The number of 2-rises of a permutation. St000871The number of very big ascents of a permutation. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000442The maximal area to the right of an up step of a Dyck path. St000862The number of parts of the shifted shape of a permutation. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001863The number of weak excedances of a signed permutation. St000441The number of successions of a permutation. St000560The number of occurrences of the pattern {{1,2},{3,4}} in a set partition. St000665The number of rafts of a permutation. St000678The number of up steps after the last double rise of a Dyck path. St000906The length of the shortest maximal chain in a poset. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000181The number of connected components of the Hasse diagram for the poset. St000635The number of strictly order preserving maps of a poset into itself. St001490The number of connected components of a skew partition. St001890The maximum magnitude of the Möbius function of a poset. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000245The number of ascents of a permutation. St000444The length of the maximal rise of a Dyck path. St000842The breadth of a permutation. St000891The number of distinct diagonal sums of a permutation matrix. 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. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000141The maximum drop size of a permutation. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000973The length of the boundary of an ordered tree. St000975The length of the boundary minus the length of the trunk of an ordered tree. St001096The size of the overlap set of a permutation. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000247The number of singleton blocks of a set partition. St000408The number of occurrences of the pattern 4231 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000546The number of global descents of a permutation. St000573The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton and 2 a maximal element. St000931The number of occurrences of the pattern UUU in a Dyck path. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001846The number of elements which do not have a complement in the lattice. St001868The number of alignments of type NE of a signed permutation. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset.
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!