Your data matches 153 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001156
Mapping
St001156: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => 1 = 0 + 1
['A',2]
 => 1 = 0 + 1
['B',2]
 => 1 = 0 + 1
['G',2]
 => 2 = 1 + 1
['A',3]
 => 1 = 0 + 1
['B',3]
 => 2 = 1 + 1
['C',3]
 => 1 = 0 + 1
Description
The Dynkin index of the Lie algebra of given type. This is the greatest common divisor of the Dynkin indices of the representations of the Lie algebra. It is computed in [2, prop.2.6].
Matching statistic: St000142
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000142: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 0
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 0
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
Description
The number of even parts of a partition.
Matching statistic: St000513
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000513: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 0
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 0
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
Description
The number of invariant subsets of size 2 when acting with a permutation of given cycle type.
Matching statistic: St001092
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001092: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 0
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 0
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
Description
The number of distinct even parts of a partition. See Section 3.3.1 of [1].
Matching statistic: St001252
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001252: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 0
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 0
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
Description
Half the sum of the even parts of a partition.
Matching statistic: St001586
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001586: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 0
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 0
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
Description
The number of odd parts smaller than the largest even part in an integer partition.
Matching statistic: St001587
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001587: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 0
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 0
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
Description
Half of the largest even part of an integer partition. The largest even part is recorded by [[St000995]].
Matching statistic: St001588
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001588: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 0
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 0
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
Description
The number of distinct odd parts smaller than the largest even part in an integer partition.
Matching statistic: St001657
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001657: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 0
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 0
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 0
Description
The number of twos in an integer partition. The total number of twos in all partitions of $n$ is equal to the total number of singletons [[St001484]] in all partitions of $n-1$, see [1].
Matching statistic: St000143
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00313: Integer partitions —Glaisher-Franklin inverse⟶ Integer partitions
St000143: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => [1]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [1,1,1]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => [3,1]
 => 0
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => [5,1]
 => 0
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => [3,1,1,1]
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => [5,3,1]
 => 0
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => [5,3,1]
 => 0
Description
The largest repeated part of a partition. If the parts of the partition are all distinct, the value of the statistic is defined to be zero.
The following 143 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000149The number of cells of the partition whose leg is zero and arm is odd. St000150The floored half-sum of the multiplicities of a partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000257The number of distinct parts of a partition that occur at least twice. St000292The number of ascents of a binary word. St000348The non-inversion sum of a binary word. St000628The balance of a binary word. St000682The Grundy value of Welter's game on a binary word. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001423The number of distinct cubes in a binary word. St000626The minimal period of a binary word. St001313The number of Dyck paths above the lattice path given by a binary word. St001484The number of singletons of an integer partition. St000928The sum of the coefficients of the character polynomial of an integer partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000993The multiplicity of the largest part of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000137The Grundy value of an integer partition. St000148The number of odd parts of a partition. St000671The maximin edge-connectivity for choosing a subgraph. St001383The BG-rank of an integer partition. St000273The domination number of a 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. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000916The packing number of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001829The common independence number of a graph. St001881The number of factors of a lattice as a Cartesian product of lattices. St000091The descent variation of a composition. 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. St000370The genus of a graph. St000379The number of Hamiltonian cycles in a graph. St000449The number of pairs of vertices of a graph with distance 4. St000552The number of cut vertices of a graph. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001271The competition number of a graph. St001307The number of induced stars on four vertices in a graph. St001309The number of four-cliques in a graph. St001323The independence gap of a graph. St001324The minimal number of occurrences of the chordal-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. 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. St001350Half of the Albertson index of a graph. St001353The number of prime nodes in the modular decomposition of a graph. St001479The number of bridges of a graph. St001574The minimal number of edges to add or remove to make a graph regular. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001577The minimal number of edges to add or remove to make a graph a cograph. St001578The minimal number of edges to add or remove to make a graph a line graph. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001691The number of kings in a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001742The difference of the maximal and the minimal degree in a graph. St001797The number of overfull subgraphs of a graph. St001826The maximal number of leaves on a vertex of a graph. St001827The number of two-component spanning forests of a graph. St001871The number of triconnected components of a graph. St000535The rank-width of a graph. St000544The cop number of a graph. St000553The number of blocks of a graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000917The open packing number of a graph. St001057The Grundy value of the game of creating an independent set in a graph. St001111The weak 2-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001256Number of simple reflexive modules that are 2-stable reflexive. St001272The number of graphs with the same degree sequence. St001282The number of graphs with the same chromatic polynomial. St001393The induced matching number of a graph. St001642The Prague dimension of a graph. St001716The 1-improper chromatic number of a graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001765The number of connected components of the friends and strangers graph. 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. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St000469The distinguishing 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. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001060The distinguishing index of a graph. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000992The alternating sum of the parts of an integer partition. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001570The minimal number of edges to add to make a graph Hamiltonian. St001638The book thickness of a graph. St001845The number of join irreducibles minus the rank of a lattice. St001846The number of elements which do not have a complement in the lattice. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001118The acyclic chromatic index of a graph. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001722The number of minimal chains with small intervals between a binary word and the top element. St001820The size of the image of the pop stack sorting operator. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001002Number of indecomposable modules with projective and injective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St000181The number of connected components of the Hasse diagram for the poset. St000455The second largest eigenvalue of a graph if it is integral. St001877Number of indecomposable injective modules with projective dimension 2. St001964The interval resolution global dimension of a poset. St000315The number of isolated vertices of a graph. St000322The skewness of a graph. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000287The number of connected components of a graph. St000310The minimal degree of a vertex of a graph. St000936The number of even values of the symmetric group character corresponding to the partition. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001518The number of graphs with the same ordinary spectrum as the given graph. St001624The breadth of a lattice. St001783The number of odd automorphisms of a graph. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000286The number of connected components of the complement of a graph. St000311The number of vertices of odd degree in a graph.