searching the database
Your data matches 81 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: St000010
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> ([],1)
=> [1]
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> ([(0,1)],2)
=> [2]
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> [2]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> [3,1]
=> 2
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [4,2]
=> 2
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [4,2]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> [5,2]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
=> [5,3]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> 2
Description
The length of the partition.
Matching statistic: St000097
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000097: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000097: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> ([],1)
=> ([],1)
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> ([(0,1)],2)
=> ([],2)
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> ([],2)
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 2
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> ([(2,5),(3,4),(4,5)],6)
=> 2
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 2
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> ([(2,5),(3,4),(4,5)],6)
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(4,5)],6)
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(4,5)],6)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(4,5)],6)
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(3,6),(4,5)],7)
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(4,5)],6)
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(4,5)],6)
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> ([(4,5)],6)
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> ([(4,5)],6)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> ([(4,5)],6)
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
=> ([(2,7),(3,6),(4,5),(4,6),(5,7),(6,7)],8)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> ([(4,5)],6)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(4,5)],6)
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(4,5)],6)
=> 2
Description
The order of the largest clique of the graph.
A clique in a graph $G$ is a subset $U \subseteq V(G)$ such that any pair of vertices in $U$ are adjacent. I.e. the subgraph induced by $U$ is a complete graph.
Matching statistic: St000098
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000098: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000098: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> ([],1)
=> ([],1)
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> ([(0,1)],2)
=> ([],2)
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> ([],2)
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 2
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> ([(2,5),(3,4),(4,5)],6)
=> 2
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 2
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> ([(2,5),(3,4),(4,5)],6)
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(4,5)],6)
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(4,5)],6)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(4,5)],6)
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(3,6),(4,5)],7)
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(4,5)],6)
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(4,5)],6)
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> ([(4,5)],6)
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> ([(4,5)],6)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> ([(4,5)],6)
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
=> ([(2,7),(3,6),(4,5),(4,6),(5,7),(6,7)],8)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> ([(4,5)],6)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> ([(3,6),(4,5),(5,6)],7)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(4,5)],6)
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(4,5)],6)
=> 2
Description
The chromatic number of a graph.
The minimal number of colors needed to color the vertices of the graph such that no two vertices which share an edge have the same color.
Matching statistic: St001484
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001484: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001484: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> ([],1)
=> [1]
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> ([(0,1)],2)
=> [2]
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> [2]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> [3,1]
=> 2
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [4,2]
=> 2
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [4,2]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> [5,2]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
=> [5,3]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> 2
Description
The number of singletons of an integer partition.
A singleton in an integer partition is a part that appear precisely once.
Matching statistic: St001924
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001924: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001924: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> ([],1)
=> [1]
=> 1
[1,0,1,0]
=> [1,1,0,0]
=> ([(0,1)],2)
=> [2]
=> 1
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> [2]
=> 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> [3,1]
=> 2
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [4,2]
=> 2
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [4,2]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> [5,2]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
=> [5,3]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> 2
Description
The number of cells in an integer partition whose arm and leg length coincide.
Matching statistic: St000470
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000470: Permutations ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000470: Permutations ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => [1] => 1
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => [1,2] => 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => [1,2] => 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => 2
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => 2
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => 2
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => 2
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 1
[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,4,2,3,5] => 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,3,2,4,5] => 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,4,5,2,3] => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [1,3,2,4,5] => 2
[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,2,3,5,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,2,3,4,5] => 1
[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,3,5,2,4] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => [1,3,4,2,5] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => [1,3,4,5,2] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => 1
[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,2,5,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,2,4,3,5] => 2
[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,2,3,4,5] => 1
[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,2,4,5,3] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => 1
[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] => 2
[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,2,4,3,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,3,4,2,1] => [1,5,2,3,4] => 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,2,3,1,5] => [1,4,2,3,5] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,2,3,5,1] => [1,4,5,2,3] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => 2
[1,1,1,0,0,1,0,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [1,8,4,7,6,5,3,2] => [1,2,8,3,4,7,5,6] => ? = 3
[1,1,1,0,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [1,8,4,6,5,3,7,2] => [1,2,8,3,4,6,5,7] => ? = 3
[1,1,1,0,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [1,8,3,6,5,7,4,2] => ? => ? = 3
[1,1,1,0,1,0,0,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [2,8,4,7,6,5,3,1] => [1,2,8,3,4,7,5,6] => ? = 3
[1,1,1,0,1,0,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [2,8,4,6,5,3,7,1] => [1,2,8,3,4,6,5,7] => ? = 3
[1,1,1,0,1,1,0,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [2,8,3,6,5,7,4,1] => ? => ? = 3
[1,1,1,1,0,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [1,8,3,7,5,6,4,2] => [1,2,8,3,4,7,5,6] => ? = 3
[1,1,1,1,0,1,0,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [2,8,3,7,5,6,4,1] => [1,2,8,3,4,7,5,6] => ? = 3
Description
The number of runs in a permutation.
A run in a permutation is an inclusion-wise maximal increasing substring, i.e., a contiguous subsequence.
This is the same as the number of descents plus 1.
Matching statistic: St000884
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000884: Permutations ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000884: Permutations ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => [1] => 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => [1,2] => 0 = 1 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => [1,2] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 0 = 1 - 1
[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,4,2,3,5] => 1 = 2 - 1
[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,3,2,4,5] => 1 = 2 - 1
[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,4,5,2,3] => 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [1,3,2,4,5] => 1 = 2 - 1
[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,2,3,5,4] => 1 = 2 - 1
[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,2,3,4,5] => 0 = 1 - 1
[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,3,5,2,4] => 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => [1,3,4,2,5] => 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => [1,3,4,5,2] => 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[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,2,5,3,4] => 1 = 2 - 1
[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,2,4,3,5] => 1 = 2 - 1
[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,2,3,4,5] => 0 = 1 - 1
[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,2,4,5,3] => 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[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] => 1 = 2 - 1
[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,2,4,3,5] => 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,3,4,2,1] => [1,5,2,3,4] => 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,2,3,1,5] => [1,4,2,3,5] => 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,2,3,5,1] => [1,4,5,2,3] => 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => 1 = 2 - 1
[1,1,1,0,0,1,0,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [1,8,4,7,6,5,3,2] => [1,2,8,3,4,7,5,6] => ? = 3 - 1
[1,1,1,0,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [1,8,4,6,5,3,7,2] => [1,2,8,3,4,6,5,7] => ? = 3 - 1
[1,1,1,0,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [1,8,3,6,5,7,4,2] => ? => ? = 3 - 1
[1,1,1,0,1,0,0,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [2,8,4,7,6,5,3,1] => [1,2,8,3,4,7,5,6] => ? = 3 - 1
[1,1,1,0,1,0,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [2,8,4,6,5,3,7,1] => [1,2,8,3,4,6,5,7] => ? = 3 - 1
[1,1,1,0,1,1,0,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [2,8,3,6,5,7,4,1] => ? => ? = 3 - 1
[1,1,1,1,0,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [1,8,3,7,5,6,4,2] => [1,2,8,3,4,7,5,6] => ? = 3 - 1
[1,1,1,1,0,1,0,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [2,8,3,7,5,6,4,1] => [1,2,8,3,4,7,5,6] => ? = 3 - 1
Description
The number of isolated descents of a permutation.
A descent $i$ is isolated if neither $i+1$ nor $i-1$ are descents. If a permutation has only isolated descents, then it is called primitive in [1].
Matching statistic: St001022
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001022: Dyck paths ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001022: Dyck paths ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [1,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]
=> 0 = 1 - 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]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,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]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,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,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,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]
=> 0 = 1 - 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]
=> 1 = 2 - 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]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[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,1,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,1,0,1,0,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]
=> 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,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,1,0,0,0,1,0]
=> [1,0,1,1,0,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,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,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1 = 2 - 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,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,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]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[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]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,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,0,0,1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,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,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,1,1,1,0,0,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,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,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1 = 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,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1 = 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,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 0 = 1 - 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]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,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,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,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]
=> 0 = 1 - 1
[1,1,0,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]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1 = 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,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1 = 2 - 1
[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,1,0,1,1,0,0,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [1,1,1,0,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> ? = 3 - 1
[1,1,1,0,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [1,1,1,0,0,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,1,0,0,0]
=> ? = 3 - 1
[1,1,1,0,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0]
=> ? = 3 - 1
[1,1,1,0,1,0,0,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 3 - 1
[1,1,1,0,1,0,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,0,1,1,0,1,0,1,0,0,0]
=> ? = 3 - 1
[1,1,1,0,1,1,0,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,1,0,0,1,0]
=> ? = 3 - 1
[1,1,1,1,0,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,1,0,0,1,0,0,0]
=> ? = 3 - 1
[1,1,1,1,0,1,0,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,1,0,0,1,0,0,0,0]
=> [1,1,1,1,1,0,0,1,0,1,0,0,1,0,0,0]
=> ? = 3 - 1
Description
Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001031
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001031: Dyck paths ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001031: Dyck paths ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 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,0,1,1,1,0,0,0,1,0]
=> 1 = 2 - 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]
=> [1,0,1,1,0,0,1,0,1,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,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 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]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 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]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 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]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 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]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 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]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 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]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 2 - 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]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 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]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 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]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 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]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 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,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 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]
=> [1,0,1,1,1,0,0,0,1,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,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,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,1,1,1,1,0,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 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]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 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]
=> [1,0,1,0,1,0,1,1,0,0,1,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,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 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,0,1,1,0,0,1,1,0,0,1,0]
=> 1 = 2 - 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]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 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]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 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]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 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]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 1 = 2 - 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]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 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]
=> [1,0,1,0,1,1,1,0,0,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,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 1 = 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]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 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]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 1 = 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]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 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]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 1 = 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]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 1 = 2 - 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]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> 1 = 2 - 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]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 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]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 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]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 1 = 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]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 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]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,0,0,1,0,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [1,1,0,1,1,1,1,0,1,1,1,0,0,0,0,0,0,0]
=> ?
=> ? = 3 - 1
[1,1,1,0,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [1,1,0,1,1,1,1,0,1,1,0,0,0,1,0,0,0,0]
=> ?
=> ? = 3 - 1
[1,1,1,0,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,0,0]
=> ?
=> ? = 3 - 1
[1,1,1,0,1,0,0,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [1,1,1,0,1,1,1,0,1,1,1,0,0,0,0,0,0,0]
=> ?
=> ? = 3 - 1
[1,1,1,0,1,0,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [1,1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0,0]
=> ?
=> ? = 3 - 1
[1,1,1,0,1,1,0,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [1,1,1,0,1,1,0,1,1,1,0,0,1,0,0,0,0,0]
=> ?
=> ? = 3 - 1
[1,1,1,1,0,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [1,1,0,1,1,1,0,1,1,1,0,1,0,0,0,0,0,0]
=> ?
=> ? = 3 - 1
[1,1,1,1,0,1,0,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,0,1,1,0,1,1,1,0,1,0,0,0,0,0,0]
=> ?
=> ? = 3 - 1
Description
The height of the bicoloured Motzkin path associated with the Dyck path.
Matching statistic: St001729
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St001729: Permutations ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St001729: Permutations ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => [1] => 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [2,1] => [1,2] => 0 = 1 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => [1,2] => 0 = 1 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => 0 = 1 - 1
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => 0 = 1 - 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 0 = 1 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 0 = 1 - 1
[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,4,2,3,5] => 1 = 2 - 1
[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,3,2,4,5] => 1 = 2 - 1
[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,4,5,2,3] => 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [1,3,2,4,5] => 1 = 2 - 1
[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,2,3,5,4] => 1 = 2 - 1
[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,2,3,4,5] => 0 = 1 - 1
[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,3,5,2,4] => 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => [1,3,4,2,5] => 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => [1,3,4,5,2] => 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[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,2,5,3,4] => 1 = 2 - 1
[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,2,4,3,5] => 1 = 2 - 1
[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,2,3,4,5] => 0 = 1 - 1
[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,2,4,5,3] => 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[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] => 1 = 2 - 1
[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,2,4,3,5] => 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,3,4,2,1] => [1,5,2,3,4] => 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,2,3,1,5] => [1,4,2,3,5] => 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,2,3,5,1] => [1,4,5,2,3] => 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => 1 = 2 - 1
[1,1,1,0,0,1,0,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [1,8,4,7,6,5,3,2] => [1,2,8,3,4,7,5,6] => ? = 3 - 1
[1,1,1,0,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [1,8,4,6,5,3,7,2] => [1,2,8,3,4,6,5,7] => ? = 3 - 1
[1,1,1,0,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [1,8,3,6,5,7,4,2] => ? => ? = 3 - 1
[1,1,1,0,1,0,0,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [2,8,4,7,6,5,3,1] => [1,2,8,3,4,7,5,6] => ? = 3 - 1
[1,1,1,0,1,0,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [2,8,4,6,5,3,7,1] => [1,2,8,3,4,6,5,7] => ? = 3 - 1
[1,1,1,0,1,1,0,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [2,8,3,6,5,7,4,1] => ? => ? = 3 - 1
[1,1,1,1,0,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [1,8,3,7,5,6,4,2] => [1,2,8,3,4,7,5,6] => ? = 3 - 1
[1,1,1,1,0,1,0,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [2,8,3,7,5,6,4,1] => [1,2,8,3,4,7,5,6] => ? = 3 - 1
Description
The number of visible descents of a permutation.
A visible descent of a permutation $\pi$ is a position $i$ such that $\pi(i+1) \leq \min(i, \pi(i))$.
The following 71 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001928The number of non-overlapping descents in a permutation. St000619The number of cyclic descents of a permutation. St000159The number of distinct parts of the integer partition. St000533The minimum of the number of parts and the size of the first part of an integer partition. St001432The order dimension of the partition. St000481The number of upper covers of a partition in dominance order. St000783The side length of the largest staircase partition fitting into a partition. St000318The number of addable cells of the Ferrers diagram of an integer partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000527The width of the poset. St000035The number of left outer peaks of a permutation. St001394The genus of a permutation. St001335The cardinality of a minimal cycle-isolating set of a graph. St000544The cop number of a graph. St001029The size of the core of a graph. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001883The mutual visibility number of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St000272The treewidth of a graph. St000535The rank-width of a graph. St000536The pathwidth of a graph. St000537The cutwidth of a graph. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001331The size of the minimal feedback vertex set. St001358The largest degree of a regular subgraph of a graph. St001638The book thickness of a graph. St001644The dimension of a graph. St001743The discrepancy of a graph. St001792The arboricity of a graph. St001826The maximal number of leaves on a vertex of a graph. St001962The proper pathwidth of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St000454The largest eigenvalue of a graph if it is integral. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St000099The number of valleys of a permutation, including the boundary. St000325The width of the tree associated to a permutation. St000021The number of descents of a permutation. St000023The number of inner peaks of a permutation. St000298The order dimension or Dushnik-Miller dimension of a poset. St000307The number of rowmotion orbits of a poset. St000640The rank of the largest boolean interval in a poset. St000822The Hadwiger number of the graph. St001330The hat guessing number of a graph. St001734The lettericity of a graph. St001624The breadth of a lattice. St001877Number of indecomposable injective modules with projective dimension 2. 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$. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001960The number of descents of a permutation minus one if its first entry is not one. St000264The girth of a graph, which is not a tree. 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$. St000455The second largest eigenvalue of a graph if it is integral. St000996The number of exclusive left-to-right maxima of a permutation. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001498The normalised height of a Nakayama algebra with magnitude 1. St000031The number of cycles in the cycle decomposition of a permutation. St001095The number of non-isomorphic posets with precisely one further covering relation. St001964The interval resolution global dimension of a poset. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St000314The number of left-to-right-maxima of a permutation. St000805The number of peaks of the associated bargraph. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001737The number of descents of type 2 in a permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000237The number of small exceedances.
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!