Your data matches 356 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001719
(load all 23 compositions to match this statistic)
Mapping
St001719: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => 1 = 0 + 1
([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(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)
 => 1 = 0 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 1 = 0 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 1 = 0 + 1
([(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)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => 1 = 0 + 1
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => 1 = 0 + 1
([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => 1 = 0 + 1
([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => 1 = 0 + 1
([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 1 = 0 + 1
Description
The number of shortest chains of small intervals from the bottom to the top in a lattice. An interval $[a, b]$ in a lattice is small if $b$ is a join of elements covering $a$.
Matching statistic: St001845
(load all 20 compositions to match this statistic)
Mapping
Mp00197: Lattices —lattice of congruences⟶ Lattices
St001845: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(2,1)],3)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,2),(2,1)],3)
 => 0
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,2),(2,1)],3)
 => 0
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,2),(2,1)],3)
 => 0
([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([(0,1)],2)
 => 0
([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([(0,2),(2,1)],3)
 => 0
([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([(0,1)],2)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([(0,2),(2,1)],3)
 => 0
([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([(0,1)],2)
 => 0
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([(0,2),(2,1)],3)
 => 0
([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0
Description
The number of join irreducibles minus the rank of a lattice. A lattice is join-extremal, if this statistic is $0$.
Matching statistic: St000068
(load all 11 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
St000068: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 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)
 => 1 = 0 + 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,2),(0,3),(1,4),(2,4),(3,1)],5)
 => 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)
 => 1 = 0 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 1 = 0 + 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,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => 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)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => 1 = 0 + 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)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => 1 = 0 + 1
([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => 1 = 0 + 1
([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => 1 = 0 + 1
([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 1 = 0 + 1
Description
The number of minimal elements in a poset.
Matching statistic: St000069
(load all 11 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
St000069: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 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)
 => 1 = 0 + 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,2),(0,3),(1,4),(2,4),(3,1)],5)
 => 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)
 => 1 = 0 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => 1 = 0 + 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,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => 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)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => 1 = 0 + 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)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => 1 = 0 + 1
([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => 1 = 0 + 1
([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => 1 = 0 + 1
([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 1 = 0 + 1
Description
The number of maximal elements of a poset.
Matching statistic: St001677
(load all 15 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00205: Posets —maximal antichains⟶ Lattices
St001677: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 0
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(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)
 => ([(0,2),(2,1)],3)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(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)
 => ([(0,2),(2,1)],3)
 => 0
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(2,1),(3,2)],4)
 => 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,3),(2,1),(3,2)],4)
 => 0
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(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),(2,1),(3,2)],4)
 => 0
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,2),(2,1)],3)
 => 0
([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([(0,3),(2,1),(3,2)],4)
 => 0
([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,5),(1,6),(2,6),(3,6),(5,1),(5,2),(5,3),(6,4)],7)
 => 0
Description
The number of non-degenerate subsets of a lattice whose meet is the bottom element. A subset whose meet is the bottom element is non-degenerate, if it neither contains the bottom, nor the top element of the lattice.
Matching statistic: St001846
(load all 4 compositions to match this statistic)
Mapping
Mp00197: Lattices —lattice of congruences⟶ Lattices
Mp00197: Lattices —lattice of congruences⟶ Lattices
St001846: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 0
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,3),(2,1),(3,2)],4)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,4),(1,5),(2,5),(3,5),(4,1),(4,2),(4,3)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 0
([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 0
Description
The number of elements which do not have a complement in the lattice. A complement of an element $x$ in a lattice is an element $y$ such that the meet of $x$ and $y$ is the bottom element and their join is the top element.
Matching statistic: St001624
(load all 7 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00206: Posets —antichains of maximal size⟶ Lattices
St001624: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([],1)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 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)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,1)],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)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([],1)
 => 1 = 0 + 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)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([],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)
 => ([],1)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([],1)
 => 1 = 0 + 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)
 => ([],1)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([],1)
 => 1 = 0 + 1
([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([],1)
 => 1 = 0 + 1
([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([],1)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([],1)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([],1)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([],1)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([],1)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([],1)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1)],2)
 => 1 = 0 + 1
Description
The breadth of a lattice. The '''breadth''' of a lattice is the least integer $b$ such that any join $x_1\vee x_2\vee\cdots\vee x_n$, with $n > b$, can be expressed as a join over a proper subset of $\{x_1,x_2,\ldots,x_n\}$.
Matching statistic: St001681
(load all 15 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00205: Posets —maximal antichains⟶ Lattices
St001681: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 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)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,3),(2,1),(3,2)],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)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 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)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(2,1),(3,2)],4)
 => 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,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 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),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,5),(1,6),(2,6),(3,6),(5,1),(5,2),(5,3),(6,4)],7)
 => 1 = 0 + 1
Description
The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. For example, the pentagon lattice has three such sets: the bottom element, and the two antichains of size two. The cube is the smallest lattice which has such sets of three different sizes: the bottom element, six antichains of size two and one antichain of size three.
Matching statistic: St001820
(load all 4 compositions to match this statistic)
Mapping
Mp00197: Lattices —lattice of congruences⟶ Lattices
Mp00197: Lattices —lattice of congruences⟶ Lattices
St001820: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(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,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 1 = 0 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 1 = 0 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,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),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(2,5),(3,5),(4,5),(5,1)],6)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => 1 = 0 + 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: St001881
(load all 15 compositions to match this statistic)
Mapping
Mp00193: Lattices —to poset⟶ Posets
Mp00205: Posets —maximal antichains⟶ Lattices
St001881: Lattices ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => ([],1)
 => ([],1)
 => 1 = 0 + 1
([(0,1)],2)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 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)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
 => ([(0,3),(2,1),(3,2)],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)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 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)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,2),(0,3),(0,4),(1,5),(2,5),(3,5),(4,1)],6)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(0,4),(1,5),(2,5),(3,5),(4,1),(4,2)],6)
 => ([(0,3),(2,1),(3,2)],4)
 => 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,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(4,5)],6)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 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),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
 => ([(0,2),(2,1)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,2),(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([(0,3),(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([(0,4),(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([(0,5),(1,6),(2,6),(3,6),(4,6),(5,1),(5,2),(5,3),(5,4)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,5),(4,5),(5,6)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([(0,1),(0,2),(0,3),(0,4),(1,6),(2,6),(3,6),(4,5),(6,5)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([(0,2),(0,3),(0,4),(0,5),(2,6),(3,6),(4,6),(5,6),(6,1)],7)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,6),(5,6),(6,7)],8)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,7),(2,7),(3,7),(4,7),(5,6),(7,6)],8)
 => ([(0,3),(2,1),(3,2)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
 => ([(0,5),(1,6),(2,6),(3,6),(5,1),(5,2),(5,3),(6,4)],7)
 => 1 = 0 + 1
Description
The number of factors of a lattice as a Cartesian product of lattices. Since the cardinality of a lattice is the product of the cardinalities of its factors, this statistic is one whenever the cardinality of the lattice is prime.
The following 346 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000290The major index of a binary word. St000291The number of descents of a binary word. St000293The number of inversions of a binary word. St000296The length of the symmetric border of a binary word. St000347The inversion sum of a binary word. St000386The number of factors DDU in a Dyck path. St000629The defect of a binary word. St000632The jump number of the poset. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000921The number of internal inversions of a binary word. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001137Number of simple modules that are 3-regular in the corresponding Nakayama algebra. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001301The first Betti number of the order complex associated with the poset. St001371The length of the longest Yamanouchi prefix of a binary word. St001396Number of triples of incomparable elements in a finite poset. St001397Number of pairs of incomparable elements in a finite poset. St001398Number of subsets of size 3 of elements in a poset that form a "v". St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001485The modular major index of a binary word. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001695The natural comajor index of a standard Young tableau. St001696The natural major index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001712The number of natural descents of a standard Young tableau. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001902The number of potential covers of a poset. St001964The interval resolution global dimension of a poset. St000071The number of maximal chains in a poset. St000181The number of connected components of the Hasse diagram for the poset. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000297The number of leading ones in a binary word. St000298The order dimension or Dushnik-Miller dimension of a poset. St000307The number of rowmotion orbits of a poset. St000326The position of the first one in a binary word after appending a 1 at the end. St000527The width of the poset. St000627The exponent of a binary word. St000655The length of the minimal rise of a Dyck path. St000667The greatest common divisor of the parts of the partition. St000733The row containing the largest entry of a standard tableau. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000781The number of proper colouring schemes of a Ferrers diagram. St000847The number of standard Young tableaux whose descent set is the binary word. St000908The length of the shortest maximal antichain in a poset. St000909The number of maximal chains of maximal size in a poset. St000913The number of ways to refine the partition into singletons. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001256Number of simple reflexive modules that are 2-stable reflexive. St001268The size of the largest ordinal summand in the poset. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001399The distinguishing number of a poset. St001472The permanent of the Coxeter matrix of the poset. St001481The minimal height of a peak of a Dyck path. St001510The number of self-evacuating linear extensions of a finite poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001534The alternating sum of the coefficients of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001779The order of promotion on the set of linear extensions of a poset. St000439The position of the first down step of a Dyck path. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St000095The number of triangles of a graph. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000322The skewness of a graph. St000323The minimal crossing number of a graph. St000368The Altshuler-Steinberg determinant of a graph. St000370The genus of a graph. St000403The Szeged index minus the Wiener index of a graph. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St000637The length of the longest cycle in a graph. St000671The maximin edge-connectivity for choosing a subgraph. St000929The constant term of the character polynomial of an integer partition. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001175The size of a partition minus the hook length of the base cell. St001305The number of induced cycles on four vertices in a graph. St001306The number of induced paths on four vertices in a graph. St001307The number of induced stars on four vertices in a graph. St001309The number of four-cliques in a graph. St001310The number of induced diamond graphs in a graph. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001335The cardinality of a minimal cycle-isolating set of a graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001577The minimal number of edges to add or remove to make a graph a cograph. St001651The Frankl number of a lattice. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001718The number of non-empty open intervals in a poset. St001736The total number of cycles in a graph. St001793The difference between the clique number and the chromatic number of a graph. St001797The number of overfull subgraphs of a graph. St001871The number of triconnected components of a graph. St000183The side length of the Durfee square of an integer partition. St000266The number of spanning subgraphs of a graph with the same connected components. St000267The number of maximal spanning forests contained in a graph. St000785The number of distinct colouring schemes of a graph. St000993The multiplicity of the largest part of an integer partition. St001272The number of graphs with the same degree sequence. St001282The number of graphs with the same chromatic polynomial. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001496The number of graphs with the same Laplacian spectrum as the given graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001546The number of monomials in the Tutte polynomial of a graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St000351The determinant of the adjacency matrix of a graph. St000448The number of pairs of vertices of a graph with distance 2. St000478Another weight of a partition according to Alladi. St000552The number of cut vertices of a graph. St000661The number of rises of length 3 of a Dyck path. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001119The length of a shortest maximal path in a graph. St001141The number of occurrences of hills of size 3 in a Dyck path. St001271The competition number of a graph. St001308The number of induced paths on three vertices in a graph. St001323The independence gap of a graph. St001350Half of the Albertson index of a graph. St001351The Albertson index of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001374The Padmakar-Ivan index of a graph. St001395The number of strictly unfriendly partitions of a graph. St001689The number of celebrities in a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001764The number of non-convex subsets of vertices in a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000897The number of different multiplicities of parts of an integer partition. St001316The domatic number of a graph. St001568The smallest positive integer that does not appear twice in the partition. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001890The maximum magnitude of the Möbius function of a poset. St000379The number of Hamiltonian cycles in a graph. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000807The sum of the heights of the valleys of the associated bargraph. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000850The number of 1/2-balanced pairs in a poset. St001095The number of non-isomorphic posets with precisely one further covering relation. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000100The number of linear extensions of a poset. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000383The last part of an integer composition. St000524The number of posets with the same order polynomial. St000525The number of posets with the same zeta polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000633The size of the automorphism group of a poset. St000635The number of strictly order preserving maps of a poset into itself. St000640The rank of the largest boolean interval in a poset. St000657The smallest part of an integer composition. St000805The number of peaks of the associated bargraph. St000910The number of maximal chains of minimal length in a poset. St000914The sum of the values of the Möbius function of a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000091The descent variation of a composition. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000274The number of perfect matchings of a graph. St000310The minimal degree of a vertex of a graph. St000761The number of ascents in an integer composition. St000768The number of peaks in an integer composition. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001578The minimal number of edges to add or remove to make a graph a line graph. St001596The number of two-by-two squares inside a skew partition. St000273The domination number of a graph. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000315The number of isolated vertices of a graph. St000544The cop number of a graph. St000553The number of blocks of a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000758The length of the longest staircase fitting into an integer composition. St000763The sum of the positions of the strong records of an integer composition. St000764The number of strong records in an integer composition. St000765The number of weak records in an integer composition. St000816The number of standard composition tableaux of the composition. St000900The minimal number of repetitions of a part in an integer composition. St000902 The minimal number of repetitions of an integer composition. St000916The packing number of a graph. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001363The Euler characteristic of a graph according to Knill. St001463The number of distinct columns in the nullspace of a graph. St001498The normalised height of a Nakayama algebra with magnitude 1. St001597The Frobenius rank of a skew partition. St001829The common independence number of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St000699The toughness times the least common multiple of 1,. St001281The normalized isoperimetric number of a graph. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000225Difference between largest and smallest parts in a partition. St000313The number of degree 2 vertices of a graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001586The number of odd parts smaller than the largest even part in an integer partition. St001638The book thickness of a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St000762The sum of the positions of the weak records of an integer composition. St001111The weak 2-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001613The binary logarithm of the size of the center of a lattice. St001621The number of atoms of a lattice. St001694The number of maximal dissociation sets in a graph. St001716The 1-improper chromatic number of a graph. St001739The number of graphs with the same edge polytope as the given graph. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001957The number of Hasse diagrams with a given underlying undirected graph. St000264The girth of a graph, which is not a tree. St001570The minimal number of edges to add to make a graph Hamiltonian. St000940The number of characters of the symmetric group whose value on the partition is zero. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St001128The exponens consonantiae of a partition. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St000268The number of strongly connected orientations of a graph. St000344The number of strongly connected outdegree sequences of a graph. St000455The second largest eigenvalue of a graph if it is integral. St001073The number of nowhere zero 3-flows of a graph. St001353The number of prime nodes in the modular decomposition of a graph. St001356The number of vertices in prime modules of a graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001477The number of nowhere zero 5-flows of a graph. St001478The number of nowhere zero 4-flows of a graph. St001521Half the total irregularity of a graph. St001522The total irregularity of a graph. St001574The minimal number of edges to add or remove to make a graph regular. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001647The number of edges that can be added without increasing the clique number. St001648The number of edges that can be added without increasing the chromatic number. St001692The number of vertices with higher degree than the average degree in a graph. St001703The villainy of a graph. St001708The number of pairs of vertices of different degree in a graph. St001742The difference of the maximal and the minimal degree in a graph. St001799The number of proper separations of a graph. St000093The cardinality of a maximal independent set of vertices of a graph. St000260The radius of a connected graph. St000349The number of different adjacency matrices of a graph. St000388The number of orbits of vertices of a graph under automorphisms. St000535The rank-width of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St001057The Grundy value of the game of creating an independent set in a graph. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001333The cardinality of a minimal edge-isolating set of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001393The induced matching number of a graph. St001642The Prague dimension of a graph. St001734The lettericity of a graph. St001765The number of connected components of the friends and strangers graph. St001917The order of toric promotion on the set of labellings of a graph. St000258The burning number of a graph. St000917The open packing number of a graph. St000918The 2-limited packing number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St000159The number of distinct parts of the integer partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001484The number of singletons of an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000475The number of parts equal to 1 in a partition. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St000759The smallest missing part in an integer partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001877Number of indecomposable injective modules with projective dimension 2. St000318The number of addable cells of the Ferrers diagram of an integer partition. 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. 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. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St000456The monochromatic index of a connected graph. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001118The acyclic chromatic index of a graph. St001060The distinguishing index of a graph. St000259The diameter of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number of a connected graph. St001330The hat guessing number of a graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset.