searching the database
Your data matches 31 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: St000203
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00067: Permutations —Foata bijection⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
St000203: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00067: Permutations —Foata bijection⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
St000203: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [.,.]
=> 1
[1,0,1,0]
=> [1,2] => [1,2] => [.,[.,.]]
=> 2
[1,1,0,0]
=> [2,1] => [2,1] => [[.,.],.]
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [.,[.,[.,.]]]
=> 3
[1,0,1,1,0,0]
=> [1,3,2] => [3,1,2] => [[.,.],[.,.]]
=> 3
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => [[.,.],[.,.]]
=> 3
[1,1,0,1,0,0]
=> [2,3,1] => [2,3,1] => [[.,[.,.]],.]
=> 2
[1,1,1,0,0,0]
=> [3,2,1] => [3,2,1] => [[[.,.],.],.]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [4,1,2,3] => [[.,.],[.,[.,.]]]
=> 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [3,1,2,4] => [[.,.],[.,[.,.]]]
=> 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1,4,2] => [[.,.],[[.,.],.]]
=> 3
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [4,3,1,2] => [[[.,.],.],[.,.]]
=> 4
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => [[.,.],[.,[.,.]]]
=> 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [4,2,1,3] => [[[.,.],.],[.,.]]
=> 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [2,3,1,4] => [[.,[.,.]],[.,.]]
=> 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [2,3,4,1] => [[.,[.,[.,.]]],.]
=> 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [4,2,3,1] => [[[.,.],[.,.]],.]
=> 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,2,1,4] => [[[.,.],.],[.,.]]
=> 4
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,2,4,1] => [[[.,.],[.,.]],.]
=> 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,4,3,1] => [[.,[[.,.],.]],.]
=> 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4,3,2,1] => [[[[.,.],.],.],.]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [5,1,2,3,4] => [[.,.],[.,[.,[.,.]]]]
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [4,1,2,3,5] => [[.,.],[.,[.,[.,.]]]]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [4,1,2,5,3] => [[.,.],[.,[[.,.],.]]]
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [5,4,1,2,3] => [[[.,.],.],[.,[.,.]]]
=> 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [3,1,2,4,5] => [[.,.],[.,[.,[.,.]]]]
=> 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [5,3,1,2,4] => [[[.,.],.],[.,[.,.]]]
=> 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,1,4,2,5] => [[.,.],[[.,.],[.,.]]]
=> 4
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [3,1,4,5,2] => [[.,.],[[.,[.,.]],.]]
=> 3
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [5,3,1,4,2] => [[[.,.],.],[[.,.],.]]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [4,3,1,2,5] => [[[.,.],.],[.,[.,.]]]
=> 5
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [4,3,1,5,2] => [[[.,.],.],[[.,.],.]]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [5,1,3,4,2] => [[.,.],[[.,[.,.]],.]]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [5,4,3,1,2] => [[[[.,.],.],.],[.,.]]
=> 5
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [5,2,1,3,4] => [[[.,.],.],[.,[.,.]]]
=> 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [4,2,1,3,5] => [[[.,.],.],[.,[.,.]]]
=> 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [4,2,1,5,3] => [[[.,.],.],[[.,.],.]]
=> 4
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [5,4,2,1,3] => [[[[.,.],.],.],[.,.]]
=> 5
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> 4
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [5,2,3,1,4] => [[[.,.],[.,.]],[.,.]]
=> 4
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [5,2,3,4,1] => [[[.,.],[.,[.,.]]],.]
=> 3
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [4,2,3,1,5] => [[[.,.],[.,.]],[.,.]]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [4,2,3,5,1] => [[[.,.],[.,[.,.]]],.]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [5,4,2,3,1] => [[[[.,.],.],[.,.]],.]
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [3,2,1,4,5] => [[[.,.],.],[.,[.,.]]]
=> 5
[1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => [5,3,2,1,4] => [[[[.,.],.],.],[.,.]]
=> 5
Description
The number of external nodes of a binary tree.
That is, the number of nodes that can be reached from the root by only left steps or only right steps, plus $1$ for the root node itself. A counting formula for the number of external node in all binary trees of size $n$ can be found in [1].
Matching statistic: St000469
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000469: 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
St000469: 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)
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> ([],2)
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 3
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 3
[1,1,0,1,0,1,0,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,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 3
[1,1,1,0,1,0,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,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(4,5)],6)
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
[1,0,1,1,0,1,0,0,1,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)
=> 4
[1,0,1,1,0,1,0,1,0,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)
=> 3
[1,0,1,1,0,1,1,0,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)
=> 4
[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)
=> 5
[1,0,1,1,1,0,0,1,0,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)
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,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)
=> 3
[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)
=> 5
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
[1,1,0,0,1,1,0,1,0,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)
=> 4
[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)
=> 5
[1,1,0,1,0,0,1,0,1,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)
=> 4
[1,1,0,1,0,0,1,1,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)
=> 4
[1,1,0,1,0,1,0,0,1,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)
=> 3
[1,1,0,1,0,1,1,0,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)
=> 3
[1,1,0,1,1,0,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)
=> 4
[1,1,0,1,1,0,0,1,0,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)
=> 3
[1,1,0,1,1,1,0,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)
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
Description
The distinguishing number of a graph.
This is the minimal number of colours needed to colour the vertices of a graph, such that only the trivial automorphism of the graph preserves the colouring.
For connected graphs, this statistic is at most one plus the maximal degree of the graph, with equality attained for complete graphs, complete bipartite graphs and the cycle with five vertices, see Theorem 4.2 of [2].
Matching statistic: St000723
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000723: 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
St000723: 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)
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> ([],2)
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 3
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 3
[1,1,0,1,0,1,0,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,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 3
[1,1,1,0,1,0,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,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(4,5)],6)
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
[1,0,1,1,0,1,0,0,1,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)
=> 4
[1,0,1,1,0,1,0,1,0,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)
=> 3
[1,0,1,1,0,1,1,0,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)
=> 4
[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)
=> 5
[1,0,1,1,1,0,0,1,0,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)
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,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)
=> 3
[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)
=> 5
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
[1,1,0,0,1,1,0,1,0,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)
=> 4
[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)
=> 5
[1,1,0,1,0,0,1,0,1,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)
=> 4
[1,1,0,1,0,0,1,1,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)
=> 4
[1,1,0,1,0,1,0,0,1,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)
=> 3
[1,1,0,1,0,1,1,0,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)
=> 3
[1,1,0,1,1,0,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)
=> 4
[1,1,0,1,1,0,0,1,0,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)
=> 3
[1,1,0,1,1,1,0,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)
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
Description
The maximal cardinality of a set of vertices with the same neighbourhood in a graph.
The set of so called mating graphs, for which this statistic equals $1$, is enumerated by [1].
Matching statistic: St000776
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000776: 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
St000776: 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)
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> ([],2)
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 3
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 3
[1,1,0,1,0,1,0,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,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 3
[1,1,1,0,1,0,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,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(4,5)],6)
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
[1,0,1,1,0,1,0,0,1,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)
=> 4
[1,0,1,1,0,1,0,1,0,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)
=> 3
[1,0,1,1,0,1,1,0,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)
=> 4
[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)
=> 5
[1,0,1,1,1,0,0,1,0,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)
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,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)
=> 3
[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)
=> 5
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
[1,1,0,0,1,1,0,1,0,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)
=> 4
[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)
=> 5
[1,1,0,1,0,0,1,0,1,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)
=> 4
[1,1,0,1,0,0,1,1,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)
=> 4
[1,1,0,1,0,1,0,0,1,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)
=> 3
[1,1,0,1,0,1,1,0,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)
=> 3
[1,1,0,1,1,0,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)
=> 4
[1,1,0,1,1,0,0,1,0,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)
=> 3
[1,1,0,1,1,1,0,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)
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
Description
The maximal multiplicity of an eigenvalue in a graph.
Matching statistic: St000835
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000835: 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
St000835: 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]
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> [2]
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 3
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 3
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> [3,1]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> 3
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> 3
[1,1,0,1,0,1,0,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,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> 3
[1,1,1,0,1,0,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,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[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]
=> 5
[1,0,1,1,0,1,0,0,1,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]
=> 4
[1,0,1,1,0,1,0,1,0,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]
=> 3
[1,0,1,1,0,1,1,0,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]
=> 4
[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]
=> 5
[1,0,1,1,1,0,0,1,0,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]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> 3
[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]
=> 5
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[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]
=> 5
[1,1,0,0,1,1,0,1,0,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]
=> 4
[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]
=> 5
[1,1,0,1,0,0,1,0,1,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]
=> 4
[1,1,0,1,0,0,1,1,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]
=> 4
[1,1,0,1,0,1,0,0,1,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]
=> 3
[1,1,0,1,0,1,1,0,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]
=> 3
[1,1,0,1,1,0,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]
=> 4
[1,1,0,1,1,0,0,1,0,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]
=> 3
[1,1,0,1,1,1,0,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]
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[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]
=> 5
Description
The minimal difference in size when partitioning the integer partition into two subpartitions.
This is the optimal value of the optimisation version of the partition problem [1].
Matching statistic: St000986
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000986: 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
St000986: 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)
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> ([],2)
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 3
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 3
[1,1,0,1,0,1,0,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,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 3
[1,1,1,0,1,0,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,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(4,5)],6)
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
[1,0,1,1,0,1,0,0,1,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)
=> 4
[1,0,1,1,0,1,0,1,0,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)
=> 3
[1,0,1,1,0,1,1,0,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)
=> 4
[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)
=> 5
[1,0,1,1,1,0,0,1,0,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)
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,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)
=> 3
[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)
=> 5
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
[1,1,0,0,1,1,0,1,0,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)
=> 4
[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)
=> 5
[1,1,0,1,0,0,1,0,1,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)
=> 4
[1,1,0,1,0,0,1,1,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)
=> 4
[1,1,0,1,0,1,0,0,1,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)
=> 3
[1,1,0,1,0,1,1,0,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)
=> 3
[1,1,0,1,1,0,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)
=> 4
[1,1,0,1,1,0,0,1,0,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)
=> 3
[1,1,0,1,1,1,0,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)
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
Description
The multiplicity of the eigenvalue zero of the adjacency matrix of the graph.
Matching statistic: St000992
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000992: 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
St000992: 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]
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> [2]
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 3
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 3
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> [3,1]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> 3
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> 3
[1,1,0,1,0,1,0,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,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> 3
[1,1,1,0,1,0,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,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[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]
=> 5
[1,0,1,1,0,1,0,0,1,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]
=> 4
[1,0,1,1,0,1,0,1,0,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]
=> 3
[1,0,1,1,0,1,1,0,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]
=> 4
[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]
=> 5
[1,0,1,1,1,0,0,1,0,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]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> 3
[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]
=> 5
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[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]
=> 5
[1,1,0,0,1,1,0,1,0,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]
=> 4
[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]
=> 5
[1,1,0,1,0,0,1,0,1,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]
=> 4
[1,1,0,1,0,0,1,1,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]
=> 4
[1,1,0,1,0,1,0,0,1,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]
=> 3
[1,1,0,1,0,1,1,0,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]
=> 3
[1,1,0,1,1,0,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]
=> 4
[1,1,0,1,1,0,0,1,0,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]
=> 3
[1,1,0,1,1,1,0,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]
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[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]
=> 5
Description
The alternating sum of the parts of an integer partition.
For a partition $\lambda = (\lambda_1,\ldots,\lambda_k)$, this is $\lambda_1 - \lambda_2 + \cdots \pm \lambda_k$.
Matching statistic: St001055
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001055: 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
St001055: 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]
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> [2]
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 3
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 3
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> [3,1]
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> 3
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> 3
[1,1,0,1,0,1,0,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,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> 3
[1,1,1,0,1,0,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,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[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]
=> 5
[1,0,1,1,0,1,0,0,1,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]
=> 4
[1,0,1,1,0,1,0,1,0,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]
=> 3
[1,0,1,1,0,1,1,0,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]
=> 4
[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]
=> 5
[1,0,1,1,1,0,0,1,0,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]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> 3
[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]
=> 5
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[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]
=> 5
[1,1,0,0,1,1,0,1,0,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]
=> 4
[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]
=> 5
[1,1,0,1,0,0,1,0,1,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]
=> 4
[1,1,0,1,0,0,1,1,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]
=> 4
[1,1,0,1,0,1,0,0,1,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]
=> 3
[1,1,0,1,0,1,1,0,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]
=> 3
[1,1,0,1,1,0,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]
=> 4
[1,1,0,1,1,0,0,1,0,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]
=> 3
[1,1,0,1,1,1,0,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]
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> 5
[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]
=> 5
Description
The Grundy value for the game of removing cells of a row in an integer partition.
Two players alternately remove any positive number of cells in a row of the Ferrers diagram of an integer partition, such that the result is still a Ferrers diagram. The player facing the empty partition looses.
Matching statistic: St001691
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001691: 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
St001691: 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)
=> 2
[1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> ([],2)
=> 2
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 2
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> ([],3)
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 3
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 3
[1,1,0,1,0,1,0,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,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(3,4)],5)
=> 3
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(3,4)],5)
=> 3
[1,1,1,0,1,0,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,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(4,5)],6)
=> 4
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
[1,0,1,1,0,1,0,0,1,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)
=> 4
[1,0,1,1,0,1,0,1,0,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)
=> 3
[1,0,1,1,0,1,1,0,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)
=> 4
[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)
=> 5
[1,0,1,1,1,0,0,1,0,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)
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,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)
=> 3
[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)
=> 5
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
[1,1,0,0,1,1,0,1,0,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)
=> 4
[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)
=> 5
[1,1,0,1,0,0,1,0,1,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)
=> 4
[1,1,0,1,0,0,1,1,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)
=> 4
[1,1,0,1,0,1,0,0,1,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)
=> 3
[1,1,0,1,0,1,1,0,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)
=> 3
[1,1,0,1,1,0,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)
=> 4
[1,1,0,1,1,0,0,1,0,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)
=> 3
[1,1,0,1,1,1,0,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)
=> 4
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 5
[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)
=> 5
Description
The number of kings in a graph.
A vertex of a graph is a king, if all its neighbours have smaller degree. In particular, an isolated vertex is a king.
Matching statistic: St000011
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 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]
=> 4 = 3 + 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]
=> 4 = 3 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 2 + 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]
=> 4 = 3 + 1
[1,0,1,0,1,0,1,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]
=> 5 = 4 + 1
[1,0,1,0,1,1,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]
=> 5 = 4 + 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]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,0,1,0,1,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]
=> 5 = 4 + 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]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,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]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,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]
=> 3 = 2 + 1
[1,1,0,1,1,0,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]
=> 4 = 3 + 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]
=> 5 = 4 + 1
[1,1,1,0,0,1,0,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]
=> 4 = 3 + 1
[1,1,1,0,1,0,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]
=> 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,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]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,1,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]
=> 6 = 5 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 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]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,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]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,1,0,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]
=> 5 = 4 + 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]
=> 6 = 5 + 1
[1,0,1,1,1,0,0,1,0,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]
=> 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 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]
=> 6 = 5 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 5 = 4 + 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]
=> 6 = 5 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,1,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]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,1,0,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]
=> 4 = 3 + 1
[1,1,0,1,1,0,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]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,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]
=> 4 = 3 + 1
[1,1,0,1,1,1,0,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]
=> 5 = 4 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 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]
=> 6 = 5 + 1
Description
The number of touch points (or returns) of a Dyck path.
This is the number of points, excluding the origin, where the Dyck path has height 0.
The following 21 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000636The hull number of a graph. St001654The monophonic hull number of a graph. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St000907The number of maximal antichains of minimal length in a poset. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. 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. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St000213The number of weak exceedances (also weak excedences) of a permutation. St000314The number of left-to-right-maxima of a permutation. St000315The number of isolated vertices of a graph. St000031The number of cycles in the cycle decomposition of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000703The number of deficiencies of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St000996The number of exclusive left-to-right maxima of a permutation. St001875The number of simple modules with projective dimension at most 1.
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!