- FindStat

Your data matches 43 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)

Matching statistic: St000294
(load all 47 compositions to match this statistic)

Mapping

St000294: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

=> 2
=> 2
=> 3
=> 4
=> 4
=> 3
=> 4
=> 6
=> 6
=> 6
=> 6
=> 6
=> 6
=> 4

Description

The number of distinct factors of a binary word. This is also known as the subword complexity of a binary word, see [1].

Matching statistic: St000189
(load all 3 compositions to match this statistic)

Mapping

Mp00262: Binary words —poset of factors⟶ Posets
St000189: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => ([(0,1)],2)
 => 2
1 => ([(0,1)],2)
 => 2
00 => ([(0,2),(2,1)],3)
 => 3
01 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 4
10 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 4
11 => ([(0,2),(2,1)],3)
 => 3
000 => ([(0,3),(2,1),(3,2)],4)
 => 4
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => 6
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => 6
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
111 => ([(0,3),(2,1),(3,2)],4)
 => 4

Description

The number of elements in the poset.

Matching statistic: St000518
(load all 13 compositions to match this statistic)

Mapping

Mp00224: Binary words —runsort⟶ Binary words
St000518: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

=> 0 => 2
=> 1 => 2
=> 00 => 3
=> 01 => 4
=> 01 => 4
=> 11 => 3
=> 000 => 4
=> 001 => 6
=> 001 => 6
=> 011 => 6
=> 001 => 6
=> 011 => 6
=> 011 => 6
=> 111 => 4

Description

The number of distinct subsequences in a binary word. In contrast to the subword complexity [[St000294]] this is the cardinality of the set of all subsequences of not necessarily consecutive letters.

Matching statistic: St001717
(load all 3 compositions to match this statistic)

Mapping

Mp00262: Binary words —poset of factors⟶ Posets
St001717: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => ([(0,1)],2)
 => 2
1 => ([(0,1)],2)
 => 2
00 => ([(0,2),(2,1)],3)
 => 3
01 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 4
10 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 4
11 => ([(0,2),(2,1)],3)
 => 3
000 => ([(0,3),(2,1),(3,2)],4)
 => 4
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => 6
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => 6
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
111 => ([(0,3),(2,1),(3,2)],4)
 => 4

Description

The largest size of an interval in a poset.

Matching statistic: St001300
(load all 3 compositions to match this statistic)

Mapping

Mp00262: Binary words —poset of factors⟶ Posets
St001300: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => ([(0,1)],2)
 => 1 = 2 - 1
1 => ([(0,1)],2)
 => 1 = 2 - 1
00 => ([(0,2),(2,1)],3)
 => 2 = 3 - 1
01 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
10 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 3 = 4 - 1
11 => ([(0,2),(2,1)],3)
 => 2 = 3 - 1
000 => ([(0,3),(2,1),(3,2)],4)
 => 3 = 4 - 1
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 5 = 6 - 1
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => 5 = 6 - 1
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 5 = 6 - 1
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 5 = 6 - 1
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => 5 = 6 - 1
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 5 = 6 - 1
111 => ([(0,3),(2,1),(3,2)],4)
 => 3 = 4 - 1

Description

The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset.

Matching statistic: St000228
(load all 2 compositions to match this statistic)

Mapping

Mp00262: Binary words —poset of factors⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000228: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => ([(0,1)],2)
 => [2]
 => 2
1 => ([(0,1)],2)
 => [2]
 => 2
00 => ([(0,2),(2,1)],3)
 => [3]
 => 3
01 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 4
10 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => [3,1]
 => 4
11 => ([(0,2),(2,1)],3)
 => [3]
 => 3
000 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 4
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => [4,2]
 => 6
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => [4,2]
 => 6
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => [4,2]
 => 6
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => [4,2]
 => 6
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => [4,2]
 => 6
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => [4,2]
 => 6
111 => ([(0,3),(2,1),(3,2)],4)
 => [4]
 => 4

Description

The size of a partition. This statistic is the constant statistic of the level sets.

Matching statistic: St000479

Mapping

Mp00262: Binary words —poset of factors⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000479: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => ([(0,1)],2)
 => ([],2)
 => 2
1 => ([(0,1)],2)
 => ([],2)
 => 2
00 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3
01 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 4
10 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 4
11 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3
000 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 6
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => ([(2,5),(3,4)],6)
 => 6
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 6
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 6
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => ([(2,5),(3,4)],6)
 => 6
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(2,5),(3,4),(4,5)],6)
 => 6
111 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4

Description

The Ramsey number of a graph. This is the smallest integer

$n$ such that every two-colouring of the edges of the complete graph

$K_n$ contains a (not necessarily induced) monochromatic copy of the given graph. [1] Thus, the Ramsey number of the complete graph

$K_n$ is the ordinary Ramsey number

$R(n,n)$ . Very few of these numbers are known, in particular, it is only known that

$43\leq R(5,5)\leq 48$ . [2,3,4,5]

Matching statistic: St000656

Mapping

Mp00224: Binary words —runsort⟶ Binary words
Mp00262: Binary words —poset of factors⟶ Posets
St000656: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => 0 => ([(0,1)],2)
 => 2
1 => 1 => ([(0,1)],2)
 => 2
00 => 00 => ([(0,2),(2,1)],3)
 => 3
01 => 01 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 4
10 => 01 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 4
11 => 11 => ([(0,2),(2,1)],3)
 => 3
000 => 000 => ([(0,3),(2,1),(3,2)],4)
 => 4
001 => 001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
010 => 001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
011 => 011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
100 => 001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
101 => 011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
110 => 011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 6
111 => 111 => ([(0,3),(2,1),(3,2)],4)
 => 4

Description

The number of cuts of a poset. A cut is a subset

$A$ of the poset such that the set of lower bounds of the set of upper bounds of

$A$ is exactly

$A$ .

Matching statistic: St000915
(load all 2 compositions to match this statistic)

Mapping

Mp00262: Binary words —poset of factors⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St000915: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
1 => ([(0,1)],2)
 => ([(0,1)],2)
 => 2
00 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 3
01 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 4
10 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 4
11 => ([(0,2),(2,1)],3)
 => ([(0,2),(1,2)],3)
 => 3
000 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(1,2),(2,3)],4)
 => 4
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
 => 6
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => ([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6)
 => 6
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
 => 6
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
 => 6
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
 => ([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6)
 => 6
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
 => 6
111 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(1,2),(2,3)],4)
 => 4

Description

The Ore degree of a graph. This is the maximal Ore degree of an edge, which is the sum of the degrees of its two endpoints.

Matching statistic: St000926
(load all 4 compositions to match this statistic)

Mapping

Mp00178: Binary words —to composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000926: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [2] => ([],2)
 => 2
1 => [1,1] => ([(0,1)],2)
 => 2
00 => [3] => ([],3)
 => 3
01 => [2,1] => ([(0,2),(1,2)],3)
 => 4
10 => [1,2] => ([(1,2)],3)
 => 4
11 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => 3
000 => [4] => ([],4)
 => 4
001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => 6
010 => [2,2] => ([(1,3),(2,3)],4)
 => 6
011 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 6
100 => [1,3] => ([(2,3)],4)
 => 6
101 => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 6
110 => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
 => 6
111 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 4

Description

The clique-coclique number of a graph. This is the product of the size of a maximal clique [[St000097]] and the size of a maximal independent set [[St000093]].

The following 33 statistics, ordered by result quality, also match your data. Click on any of them to see the details.

St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001342The number of vertices in the center of a graph. St001622The number of join-irreducible elements of a lattice. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001746The coalition number of a graph. St000532The total number of rook placements on a Ferrers board. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001120The length of a longest path in a graph. St000087The number of induced subgraphs. St000548The number of different non-empty partial sums of an integer partition. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001725The harmonious chromatic number of a graph. St000108The number of partitions contained in the given partition. St000171The degree of the graph. St001658The total number of rook placements on a Ferrers board. St000362The size of a minimal vertex cover of a graph. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St001706The number of closed sets in a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001645The pebbling number of a connected graph. St000817The sum of the entries in the column specified by the composition of the change of basis matrix from dual immaculate quasisymmetric functions to monomial quasisymmetric functions. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001812The biclique partition number of a graph. St001875The number of simple modules with projective dimension at most 1. St000422The energy of a graph, if it is integral. St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St000455The second largest eigenvalue of a graph if it is integral.