Your data matches 7 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000986
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00157: Graphs —connected complement⟶ Graphs
St000986: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 2
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => 0
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1
Description
The multiplicity of the eigenvalue zero of the adjacency matrix of the graph.
Matching statistic: St001314
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001314: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 80%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => [1]
 => [1,0,1,0]
 => 0 = 1 - 1
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [1,0,1,0,1,0]
 => 0 = 1 - 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => 1 = 2 - 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => ? = 0 - 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => [1,0,1,0,1,0,1,0]
 => 0 = 1 - 1
Description
The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra.
Matching statistic: St001526
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001526: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 80%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => [1]
 => [1,0,1,0]
 => 2 = 1 + 1
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [1,0,1,0,1,0]
 => 2 = 1 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => 3 = 2 + 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => ? = 0 + 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => [1,0,1,0,1,0,1,0]
 => 2 = 1 + 1
Description
The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001964
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00125: Posets —dual poset⟶ Posets
St001964: Posets ⟶ ℤResult quality: 60% ●values known / values provided: 60%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,1),(0,2)],3)
 => 0 = 1 - 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(3,1),(3,2)],4)
 => 1 = 2 - 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
 => ? = 0 - 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(3,2),(3,5),(4,1),(4,5)],6)
 => ? = 1 - 1
Description
The interval resolution global dimension of a poset. This is the cardinality of the longest chain of right minimal approximations by interval modules of an indecomposable module over the incidence algebra.
Matching statistic: St001624
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00205: Posets —maximal antichains⟶ Lattices
Mp00197: Lattices —lattice of congruences⟶ Lattices
St001624: Lattices ⟶ ℤResult quality: 60% ●values known / values provided: 60%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([],1)
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,2),(2,1)],3)
 => ([(0,1),(0,2),(1,3),(2,3)],4)
 => 2
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,4),(2,3),(3,1),(4,2)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16)
 => ? = 0
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(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)
 => ? = 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: St001783
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St001783: Graphs ⟶ ℤResult quality: 60% ●values known / values provided: 60%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([(0,1)],2)
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(4,5)],6)
 => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
 => ? = 0
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,6),(1,2),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ? = 1
Description
The number of odd automorphisms of a graph. Let $D$ be an arbitrary orientation of a graph $G$. Then an automorphism of $G$ is odd, if it reverses the orientation of an odd number of edges of $D$. The graphs on $n$ vertices without any odd automorphisms are equinumerous with the number of non-isomorphic $n$-team tournaments, see [2]. The odd automorphisms of the complete graphs are precisely the even permutations.
Matching statistic: St001578
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00203: Graphs —cone⟶ Graphs
St001578: Graphs ⟶ ℤResult quality: 60% ●values known / values provided: 60%●distinct values known / distinct values provided: 67%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([(0,1)],2)
 => 0 = 1 - 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 0 = 1 - 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 2 - 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(4,5)],6)
 => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
 => ? = 0 - 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,6),(1,2),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
 => ? = 1 - 1
Description
The minimal number of edges to add or remove to make a graph a line graph.