Your data matches 52 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000854
St000854: 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]
=> 2
['G',2]
=> 2
['A',3]
=> 1
Description
The number of orbits of reflections of a finite Cartan type. Let $W$ be the Weyl group of a Cartan type. The reflections in $W$ are closed under conjugation, and this statistic counts the number of conjugacy classes of $W$ that are reflections. It is well-known that there are either one or two such conjugacy classes.
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
St000256: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',1]
=> ([],1)
=> [1]
=> 0 = 1 - 1
['A',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> 0 = 1 - 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> 1 = 2 - 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> 1 = 2 - 1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 0 = 1 - 1
Description
The number of parts from which one can substract 2 and still get an integer partition.
Matching statistic: St000159
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00321: Integer partitions 2-conjugateInteger partitions
St000159: 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]
=> 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> [2,1,1]
=> 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> [2,2,1,1]
=> 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [3,3]
=> 1
Description
The number of distinct parts of the integer partition. This statistic is also the number of removeable cells of the partition, and the number of valleys of the Dyck path tracing the shape of the partition.
Matching statistic: St000392
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00317: Integer partitions odd partsBinary words
St000392: 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 => 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> 11 => 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 101 => 1
Description
The length of the longest run of ones in a binary word.
Matching statistic: St000627
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00317: Integer partitions odd partsBinary words
St000627: 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 => 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> 11 => 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 101 => 1
Description
The exponent of a binary word. This is the largest number $e$ such that $w$ is the concatenation of $e$ identical factors. This statistic is also called '''frequency'''.
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00322: Integer partitions Loehr-WarringtonInteger partitions
St000755: 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]
=> 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> [2,1,1]
=> 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [5,1]
=> 1
Description
The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. Consider the recurrence $$f(n)=\sum_{p\in\lambda} f(n-p).$$ This statistic returns the number of distinct real roots of the associated characteristic polynomial. For example, the partition $(2,1)$ corresponds to the recurrence $f(n)=f(n-1)+f(n-2)$ with associated characteristic polynomial $x^2-x-1$, which has two real roots.
Mp00148: Finite Cartan types to root posetPosets
Mp00198: Posets incomparability graphGraphs
Mp00037: Graphs to partition of connected componentsInteger partitions
St000897: 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)
=> ([(1,2)],3)
=> [2,1]
=> 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> [2,1,1]
=> 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> [2,1,1,1,1]
=> 2
['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)
=> [5,1]
=> 1
Description
The number of different multiplicities of parts of an integer partition.
Matching statistic: St000955
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St000955: 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]
=> 1
['A',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> [1,0,1,0,1,0]
=> 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> 2
['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
['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]
=> 1
Description
Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra.
Matching statistic: St000982
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00317: Integer partitions odd partsBinary words
St000982: 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 => 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> 11 => 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> 101 => 1
Description
The length of the longest constant subword.
Matching statistic: St001282
Mp00148: Finite Cartan types to root posetPosets
Mp00074: Posets to graphGraphs
Mp00157: Graphs connected complementGraphs
St001282: 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)
=> 2
['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 number of graphs with the same chromatic polynomial.
The following 42 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St000052The number of valleys of a Dyck path not on the x-axis. St000142The number of even parts of a partition. St000143The largest repeated part of a partition. St000225Difference between largest and smallest parts in a partition. St000257The number of distinct parts of a partition that occur at least twice. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000386The number of factors DDU in a Dyck path. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000659The number of rises of length at least 2 of a Dyck path. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001092The number of distinct even parts of a partition. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001252Half the sum of the even parts of a partition. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001366The maximal multiplicity of a degree of a vertex of a graph. St001413Half the length of the longest even length palindromic prefix of a binary word. St001424The number of distinct squares in a binary word. St001578The minimal number of edges to add or remove to make a graph a line graph. St001587Half of the largest even part of an integer partition. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001654The monophonic hull number of a graph. St001657The number of twos in an integer partition. St001730The number of times the path corresponding to a binary word crosses the base line. St000480The number of lower covers of a partition in dominance order. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St000481The number of upper covers of a partition in dominance order. St001128The exponens consonantiae of a partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000934The 2-degree of an integer partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001964The interval resolution global dimension of a poset. St001624The breadth of a lattice. St001783The number of odd automorphisms of a graph.