searching the database
Your data matches 191 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St001156
St001156: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',2]
=> 1 = -1 + 2
['B',2]
=> 1 = -1 + 2
['G',2]
=> 2 = 0 + 2
['A',3]
=> 1 = -1 + 2
['B',3]
=> 2 = 0 + 2
['C',3]
=> 1 = -1 + 2
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: St000928
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000928: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St000928: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> 0
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> -1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> -1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 0
['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]
=> -1
['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]
=> -1
Description
The sum of the coefficients of the character polynomial of an integer partition.
The definition of the character polynomial can be found in [1].
Matching statistic: St000142
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%
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',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> 1 = 0 + 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> 0 = -1 + 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> 0 = -1 + 1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 1 = 0 + 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 = -1 + 1
['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 = -1 + 1
Description
The number of even parts of a partition.
Matching statistic: St000513
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%
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',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> 1 = 0 + 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> 0 = -1 + 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> 0 = -1 + 1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 1 = 0 + 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 = -1 + 1
['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 = -1 + 1
Description
The number of invariant subsets of size 2 when acting with a permutation of given cycle type.
Matching statistic: St001092
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%
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',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> 1 = 0 + 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> 0 = -1 + 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> 0 = -1 + 1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 1 = 0 + 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 = -1 + 1
['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 = -1 + 1
Description
The number of distinct even parts of a partition.
See Section 3.3.1 of [1].
Matching statistic: St001122
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001122: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001122: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> 1 = 0 + 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> 0 = -1 + 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> 0 = -1 + 1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 1 = 0 + 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 = -1 + 1
['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 = -1 + 1
Description
The multiplicity of the sign representation in the Kronecker square corresponding to a partition.
The Kronecker coefficient is the multiplicity $g_{\mu,\nu}^\lambda$ of the Specht module $S^\lambda$ in $S^\mu\otimes S^\nu$:
$$ S^\mu\otimes S^\nu = \bigoplus_\lambda g_{\mu,\nu}^\lambda S^\lambda $$
This statistic records the Kronecker coefficient $g_{\lambda,\lambda}^{1^n}$, for $\lambda\vdash n$. It equals $1$ if and only if $\lambda$ is self-conjugate.
Matching statistic: St001252
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%
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',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> 1 = 0 + 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> 0 = -1 + 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> 0 = -1 + 1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 1 = 0 + 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 = -1 + 1
['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 = -1 + 1
Description
Half the sum of the even parts of a partition.
Matching statistic: St001586
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%
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',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> 1 = 0 + 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> 0 = -1 + 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> 0 = -1 + 1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 1 = 0 + 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 = -1 + 1
['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 = -1 + 1
Description
The number of odd parts smaller than the largest even part in an integer partition.
Matching statistic: St001587
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%
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',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> 1 = 0 + 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> 0 = -1 + 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> 0 = -1 + 1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 1 = 0 + 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 = -1 + 1
['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 = -1 + 1
Description
Half of the largest even part of an integer partition.
The largest even part is recorded by [[St000995]].
Matching statistic: St001588
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%
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',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> 1 = 0 + 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> 0 = -1 + 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> 0 = -1 + 1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 1 = 0 + 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 = -1 + 1
['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 = -1 + 1
Description
The number of distinct odd parts smaller than the largest even part in an integer partition.
The following 181 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001657The number of twos in an integer partition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St000143The largest repeated part of a partition. 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. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. 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. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. 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. 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. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St000626The minimal period of a binary word. St000993The multiplicity of the largest part of an integer partition. St001313The number of Dyck paths above the lattice path given by a binary word. St001484The number of singletons 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. St001353The number of prime nodes in the modular decomposition of a graph. St001383The BG-rank of an integer partition. St001625The Möbius invariant of a lattice. St000260The radius of a connected graph. St000273The domination number of a graph. St000362The size of a minimal vertex cover of a graph. St000387The matching 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. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001393The induced matching number of a graph. St001459The number of zero columns in the nullspace of a graph. St001613The binary logarithm of the size of the center of a lattice. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001812The biclique partition number of a graph. St001829The common independence number of a graph. St001881The number of factors of a lattice as a Cartesian product of lattices. St001949The rigidity index of a graph. St000172The Grundy number of a graph. St000258The burning number of a graph. St000469The distinguishing number of a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000917The open packing number of a graph. St001060The distinguishing index of a graph. St001116The game chromatic number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001581The achromatic number of a graph. St001642The Prague dimension of a graph. St001670The connected partition number of a graph. St001734The lettericity of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001924The number of cells in an integer partition whose arm and leg length coincide. St001963The tree-depth of a graph. St000351The determinant of the adjacency matrix of a graph. 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. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. 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. St001357The maximal degree of a regular spanning subgraph of a graph. St001479The number of bridges of a graph. St001570The minimal number of edges to add to make a graph Hamiltonian. 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. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001957The number of Hasse diagrams with a given underlying undirected graph. St000171The degree of the graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex 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. 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. St001118The acyclic chromatic index 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. St001349The number of different graphs obtained from the given graph by removing an edge. St001621The number of atoms of a lattice. St001716The 1-improper chromatic number of a graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001743The discrepancy of a 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. St001792The arboricity of a graph. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St000093The cardinality of a maximal independent set of vertices of a graph. St000741The Colin de Verdière graph invariant. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000918The 2-limited packing number of a graph. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001270The bandwidth of a graph. St001286The annihilation number of a graph. St001316The domatic number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001512The minimum rank of a graph. St001654The monophonic hull number of a graph. St001672The restrained domination number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000636The hull number of a graph. St001093The detour number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001463The number of distinct columns in the nullspace of a graph. St001655The general position number of a graph. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000478Another weight of a partition according to Alladi. 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. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000992The alternating sum of the parts of an integer partition. 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. St000936The number of even values of the symmetric group character corresponding to the partition.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!