Your data matches 37 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001952
Mapping
St001952: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => 1
['A',2]
 => 1
['B',2]
 => 3
['G',2]
 => 3
Description
The number of conjugacy classes in the Weyl group of finite Cartan type whose elements are involutions.
Matching statistic: St000547
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
St000547: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [2]
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => [3,2]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [4,2]
 => 3
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [6,2]
 => 3
Description
The number of even non-empty partial sums of an integer partition.
Matching statistic: St001914
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001914: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 3
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 3
Description
The size of the orbit of an integer partition in Bulgarian solitaire. Bulgarian solitaire is the dynamical system where a move consists of removing the first column of the Ferrers diagram and inserting it as a row. This statistic returns the number of partitions that can be obtained from the given partition.
Matching statistic: St000289
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00317: Integer partitions —odd parts⟶ Binary words
St000289: Binary words ⟶ ℤ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)
 => [2,1]
 => 01 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 11 => 3
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 11 => 3
Description
The decimal representation of a binary word.
Matching statistic: St000952
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000952: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => [1,0]
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [1,0,1,1,0,0]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => [1,0,1,0,1,1,0,0]
 => 3
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => [1,0,1,0,1,0,1,0,1,1,0,0]
 => 3
Description
Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. Here the Coxeter polynomial is by definition the Coxeter polynomial of the corresponding LNakayama algebra.
Matching statistic: St001112
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St001112: 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)
 => ([(1,2)],3)
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 3
['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)
 => 3
Description
The 3-weak dynamic number of a graph. A $k$-weak-dynamic coloring of a graph $G$ is a (non-proper) coloring of $G$ in such a way that each vertex $v$ sees at least $\min\{d(v), k\}$ colors in its neighborhood. The $k$-weak-dynamic number of a graph is the smallest number of colors needed to find an $k$-dynamic coloring. This statistic records the $3$-weak-dynamic number of a graph.
Matching statistic: St001527
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00321: Integer partitions —2-conjugate⟶ Integer partitions
St001527: Integer partitions ⟶ ℤ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)
 => [2,1]
 => [3]
 => 3
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => [2,1,1]
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => [2,2,1,1]
 => 3
Description
The cyclic permutation representation number of an integer partition. This is the size of the largest cyclic group $C$ such that the fake degree is the character of a permutation representation of $C$.
Matching statistic: St000311
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00111: Graphs —complement⟶ Graphs
St000311: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => ([],1)
 => ([],1)
 => 0 = 1 - 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => 2 = 3 - 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => ([(1,2),(1,3),(2,3)],4)
 => 0 = 1 - 1
['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)
 => 2 = 3 - 1
Description
The number of vertices of odd degree in a graph.
Matching statistic: St000340
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St000340: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
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]
 => 2 = 3 - 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]
 => 2 = 3 - 1
Description
The number of non-final maximal constant sub-paths of length greater than one. This is the total number of occurrences of the patterns $110$ and $001$.
Matching statistic: St000688
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St000688: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
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]
 => 2 = 3 - 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]
 => 2 = 3 - 1
Description
The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. The global dimension is given by [[St000684]] and the dominant dimension is given by [[St000685]]. To every Dyck path there is an LNakayama algebra associated as described in [[St000684]]. Dyck paths for which the global dimension and the dominant dimension of the the LNakayama algebra coincide and both dimensions at least $2$ correspond to the LNakayama algebras that are higher Auslander algebras in the sense of [1].
The following 27 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000953The largest degree of an irreducible factor of the Coxeter polynomial of the Dyck path over the rational numbers. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000995The largest even part of an integer partition. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001248Sum of the even parts of a partition. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001586The number of odd parts smaller than the largest even part in an integer partition. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001916The number of transient elements in the orbit of Bulgarian solitaire corresponding to a necklace. St000741The Colin de Verdière graph invariant. St001703The villainy of a graph. St000096The number of spanning trees of a graph. St001386The number of prime labellings of a graph. St001488The number of corners of a skew partition. St000422The energy of a graph, if it is integral. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000950Number of tilting modules of the corresponding LNakayama algebra, where a tilting module is a generalised tilting module of projective dimension 1. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001570The minimal number of edges to add to make a graph Hamiltonian. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices 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. St000770The major index of an integer partition when read from bottom to top. St001002Number of indecomposable modules with projective and injective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path.