- FindStat

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

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

Mapping

St001720: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([(0,1)],2)
 => 2 = 0 + 2
([(0,2),(2,1)],3)
 => 3 = 1 + 2
([(0,1),(0,2),(1,3),(2,3)],4)
 => 2 = 0 + 2
([(0,3),(2,1),(3,2)],4)
 => 4 = 2 + 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => 2 = 0 + 2
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => 2 = 0 + 2
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 3 = 1 + 2
([(0,4),(2,3),(3,1),(4,2)],5)
 => 5 = 3 + 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 3 = 1 + 2
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => 2 = 0 + 2
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => 2 = 0 + 2
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => 2 = 0 + 2
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => 3 = 1 + 2
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => 3 = 1 + 2
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 4 = 2 + 2
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => 2 = 0 + 2
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => 4 = 2 + 2
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => 2 = 0 + 2
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => 4 = 2 + 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => 3 = 1 + 2
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => 2 = 0 + 2
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 3 = 1 + 2
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 6 = 4 + 2
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => 3 = 1 + 2

Description

The minimal length of a chain of small intervals in a lattice. An interval

$[a, b]$ is small if

$b$ is a join of elements covering

$a$ .

Matching statistic: St001820

Mapping

Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
St001820: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 2 = 1 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 4 = 3 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => 3 = 2 + 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => 3 = 2 + 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => 2 = 1 + 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => 2 = 1 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => 5 = 4 + 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 2 = 1 + 1

Description

The size of the image of the pop stack sorting operator. The pop stack sorting operator is defined by

$Pop_L^\downarrow(x) = x\wedge\bigwedge\{y\in L\mid y\lessdot x\}$ . This statistic returns the size of

$Pop_L^\downarrow(L)\}$ .

Matching statistic: St000080

Mapping

Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00263: Lattices —join irreducibles⟶ Posets
St000080: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([(0,1)],2)
 => ([(0,1)],2)
 => ([],1)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1)],2)
 => 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => 2
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2)],3)
 => 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => 3
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(1,2)],3)
 => 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([],4)
 => 0
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([],1)
 => 0
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,1),(0,2),(0,3)],4)
 => 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2)],3)
 => 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 2
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(3,1),(3,2)],4)
 => 2
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([],1)
 => 0
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,3),(1,3),(3,2)],4)
 => 2
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,3),(1,3),(2,3)],4)
 => 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 0
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(1,2)],3)
 => 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 4
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(1,2)],3)
 => 1

Description

The rank of the poset.

Matching statistic: St000273

Mapping

Mp00263: Lattices —join irreducibles⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000273: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([(0,1)],2)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2)],3)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4 = 3 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(1,2),(1,3)],4)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,1),(0,2),(0,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,2),(0,3),(3,1)],4)
 => ([(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(1,2),(2,3)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(3,1),(3,2)],4)
 => ([(2,3)],4)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 2 = 1 + 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5 = 4 + 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 2 = 1 + 1

Description

The domination number of a graph. The domination number of a graph is given by the minimum size of a dominating set of vertices. A dominating set of vertices is a subset of the vertex set of such that every vertex is either in this subset or adjacent to an element of this subset.

Matching statistic: St000528

Mapping

Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00263: Lattices —join irreducibles⟶ Posets
St000528: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([(0,1)],2)
 => ([(0,1)],2)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1)],2)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 1 = 0 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2)],3)
 => 2 = 1 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => 4 = 3 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([],4)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([],1)
 => 1 = 0 + 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,1),(0,2),(0,3)],4)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2)],3)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 1 = 0 + 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(3,1),(3,2)],4)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,3),(1,3),(3,2)],4)
 => 3 = 2 + 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,3),(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 5 = 4 + 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1

Description

The height of a poset. This equals the rank of the poset [[St000080]] plus one.

Matching statistic: St000544

Mapping

Mp00263: Lattices —join irreducibles⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000544: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([(0,1)],2)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2)],3)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4 = 3 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(1,2),(1,3)],4)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,1),(0,2),(0,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,2),(0,3),(3,1)],4)
 => ([(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(1,2),(2,3)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(3,1),(3,2)],4)
 => ([(2,3)],4)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 2 = 1 + 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5 = 4 + 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 2 = 1 + 1

Description

The cop number of a graph. This is the minimal number of cops needed to catch the robber. The algorithm is from [2].

Matching statistic: St000912

Mapping

Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00263: Lattices —join irreducibles⟶ Posets
St000912: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([(0,1)],2)
 => ([(0,1)],2)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1)],2)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 1 = 0 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2)],3)
 => 2 = 1 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => 4 = 3 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([],4)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([],1)
 => 1 = 0 + 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,1),(0,2),(0,3)],4)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2)],3)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 1 = 0 + 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(3,1),(3,2)],4)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,3),(1,3),(3,2)],4)
 => 3 = 2 + 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,3),(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 5 = 4 + 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1

Description

The number of maximal antichains in a poset.

Matching statistic: St001322

Mapping

Mp00263: Lattices —join irreducibles⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001322: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([(0,1)],2)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2)],3)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4 = 3 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(1,2),(1,3)],4)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,1),(0,2),(0,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,2),(0,3),(3,1)],4)
 => ([(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(1,2),(2,3)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(3,1),(3,2)],4)
 => ([(2,3)],4)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 2 = 1 + 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5 = 4 + 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 2 = 1 + 1

Description

The size of a minimal independent dominating set in a graph.

Matching statistic: St001339

Mapping

Mp00263: Lattices —join irreducibles⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St001339: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([(0,1)],2)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,1)],2)
 => ([],2)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([],3)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2)],3)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => ([],4)
 => 4 = 3 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(2,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(1,2),(1,3)],4)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,1),(0,2),(0,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,2),(0,3),(3,1)],4)
 => ([(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(1,2),(2,3)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(3,1),(3,2)],4)
 => ([(2,3)],4)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 2 = 1 + 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([],5)
 => 5 = 4 + 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(1,3),(2,3)],4)
 => 2 = 1 + 1

Description

The irredundance number of a graph. A set

$S$ of vertices is irredundant, if there is no vertex in

$S$ , whose closed neighbourhood is contained in the union of the closed neighbourhoods of the other vertices of

$S$ . The irredundance number is the smallest size of a maximal irredundant set.

Matching statistic: St001343

Mapping

Mp00196: Lattices —The modular quotient of a lattice.⟶ Lattices
Mp00263: Lattices —join irreducibles⟶ Posets
St001343: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

([(0,1)],2)
 => ([(0,1)],2)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,1)],2)
 => 2 = 1 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 1 = 0 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2)],3)
 => 2 = 1 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => 4 = 3 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([],4)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,1)],2)
 => ([],1)
 => 1 = 0 + 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,1),(0,2),(0,3)],4)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(3,2),(4,1),(4,3)],6)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2)],3)
 => 2 = 1 + 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 3 = 2 + 1
([(0,2),(0,4),(1,5),(2,5),(3,1),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 1 = 0 + 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
 => ([(0,3),(3,1),(3,2)],4)
 => 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1)],2)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
 => ([(0,3),(1,3),(3,2)],4)
 => 3 = 2 + 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,3),(1,3),(2,3)],4)
 => 2 = 1 + 1
([(0,3),(0,4),(1,5),(2,5),(3,2),(4,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
 => ([(1,2)],3)
 => 2 = 1 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => 5 = 4 + 1
([(0,3),(0,4),(1,5),(3,5),(4,1),(5,2)],6)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1

Description

The dimension of the reduced incidence algebra of a poset. The reduced incidence algebra of a poset is the subalgebra of the incidence algebra consisting of the elements which assign the same value to any two intervals that are isomorphic to each other as posets. Thus, this statistic returns the number of non-isomorphic intervals of the poset.

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

St001829The common independence number of a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000310The minimal degree of a vertex of a graph. St001316The domatic number of a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000906The length of the shortest maximal chain in a poset. St001668The number of points of the poset minus the width of the poset. St000717The number of ordinal summands of a poset. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000454The largest eigenvalue of a graph if it is integral. St001651The Frankl number of a lattice. St000656The number of cuts of a poset. St000680The Grundy value for Hackendot on posets. St000643The size of the largest orbit of antichains under Panyushev complementation. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001637The number of (upper) dissectors of a poset. St000478Another weight of a partition according to Alladi. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000934The 2-degree of an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001060The distinguishing index of a graph. St001631The number of simple modules

$S$ with

$dim Ext^1(S,A)=1$ in the incidence algebra

$A$ of the poset. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001875The number of simple modules with projective dimension at most 1. St001570The minimal number of edges to add to make a graph Hamiltonian. St000741The Colin de Verdière graph invariant. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001632The number of indecomposable injective modules

$I$ with

$dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001330The hat guessing number of a graph. St000327The number of cover relations in a poset.