Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000981
Mp00037: Graphs to partition of connected componentsInteger partitions
Mp00202: Integer partitions first row removalInteger partitions
Mp00230: Integer partitions parallelogram polyominoDyck paths
St000981: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],3)
=> [1,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([],4)
=> [1,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 4
([(2,3)],4)
=> [2,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([(0,3),(1,2)],4)
=> [2,2]
=> [2]
=> [1,0,1,0]
=> 4
([],5)
=> [1,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 6
([(3,4)],5)
=> [2,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 4
([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([(1,4),(2,3)],5)
=> [2,2,1]
=> [2,1]
=> [1,0,1,1,0,0]
=> 3
([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> [1,0,1,0]
=> 4
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> [1,0,1,0]
=> 4
([],6)
=> [1,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 8
([(4,5)],6)
=> [2,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 6
([(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 4
([(2,5),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([(2,5),(3,4)],6)
=> [2,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 4
([(2,5),(3,4),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([(1,2),(3,5),(4,5)],6)
=> [3,2,1]
=> [2,1]
=> [1,0,1,1,0,0]
=> 3
([(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 4
([(0,1),(2,5),(3,5),(4,5)],6)
=> [4,2]
=> [2]
=> [1,0,1,0]
=> 4
([(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([(2,4),(2,5),(3,4),(3,5)],6)
=> [4,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([(0,5),(1,5),(2,4),(3,4)],6)
=> [3,3]
=> [3]
=> [1,0,1,0,1,0]
=> 6
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([(0,5),(1,4),(2,3)],6)
=> [2,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> 2
([(0,1),(2,5),(3,4),(4,5)],6)
=> [4,2]
=> [2]
=> [1,0,1,0]
=> 4
([(1,2),(3,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [2,1]
=> [1,0,1,1,0,0]
=> 3
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,2]
=> [2]
=> [1,0,1,0]
=> 4
([(0,1),(2,4),(2,5),(3,4),(3,5)],6)
=> [4,2]
=> [2]
=> [1,0,1,0]
=> 4
([(0,5),(1,5),(2,3),(2,4),(3,4)],6)
=> [3,3]
=> [3]
=> [1,0,1,0,1,0]
=> 6
([(0,1),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,2]
=> [2]
=> [1,0,1,0]
=> 4
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([(0,4),(0,5),(1,2),(1,3),(2,3),(4,5)],6)
=> [3,3]
=> [3]
=> [1,0,1,0,1,0]
=> 6
([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,2]
=> [2]
=> [1,0,1,0]
=> 4
([],7)
=> [1,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 10
([(5,6)],7)
=> [2,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 8
([(4,6),(5,6)],7)
=> [3,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 6
([(3,6),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 4
([(2,6),(3,6),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([(3,6),(4,5)],7)
=> [2,2,1,1,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 6
([(3,6),(4,5),(5,6)],7)
=> [4,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 4
([(2,3),(4,6),(5,6)],7)
=> [3,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 4
([(4,5),(4,6),(5,6)],7)
=> [3,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 6
([(2,6),(3,6),(4,5),(5,6)],7)
=> [5,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([(1,2),(3,6),(4,6),(5,6)],7)
=> [4,2,1]
=> [2,1]
=> [1,0,1,1,0,0]
=> 3
([(3,6),(4,5),(4,6),(5,6)],7)
=> [4,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 4
([(0,1),(2,6),(3,6),(4,6),(5,6)],7)
=> [5,2]
=> [2]
=> [1,0,1,0]
=> 4
([(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,1,1]
=> [1,1]
=> [1,1,0,0]
=> 2
([(3,5),(3,6),(4,5),(4,6)],7)
=> [4,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 4
([(1,6),(2,6),(3,5),(4,5)],7)
=> [3,3,1]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 5
Description
The length of the longest zigzag subpath. This is the length of the longest consecutive subpath that is a zigzag of the form $010...$ or of the form $101...$.