Your data matches 98 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000854
Mapping
St000854: 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]
 => 2 = 1 + 1
['G',2]
 => 2 = 1 + 1
['A',3]
 => 1 = 0 + 1
['B',3]
 => 2 = 1 + 1
['C',3]
 => 2 = 1 + 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.
Matching statistic: St000143
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ 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)
 => ([(1,2)],3)
 => [2,1]
 => 0
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => [2,1,1]
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(4,5)],6)
 => [2,1,1,1,1]
 => 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)
 => [5,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)
 => ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
 => [7,1,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)
 => ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
 => [7,1,1]
 => 1
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.
Matching statistic: St000257
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000257: 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)
 => ([(1,2)],3)
 => [2,1]
 => 0
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => [2,1,1]
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(4,5)],6)
 => [2,1,1,1,1]
 => 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)
 => [5,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)
 => ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
 => [7,1,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)
 => ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
 => [7,1,1]
 => 1
Description
The number of distinct parts of a partition that occur at least twice. See Section 3.3.1 of [2].
Matching statistic: St000659
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St000659: 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
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [1,0,1,0,1,0]
 => 0
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => 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]
 => 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
['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,1,1,0,1,0,0,1,0,0,1,0]
 => 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,1,1,0,1,0,0,1,0,0,1,0]
 => 1
Description
The number of rises of length at least 2 of a Dyck path.
Matching statistic: St001022
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001022: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => [1,0]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [1,0,1,1,0,0]
 => 0
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => [1,0,1,0,1,1,0,0]
 => 1
['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]
 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => [1,0,1,1,1,0,0,1,0,0]
 => 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,0,1,0,1,1,1,0,1,0,0,1,0,0]
 => 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,0,1,0,1,1,1,0,1,0,0,1,0,0]
 => 1
Description
Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001092
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00322: Integer partitions —Loehr-Warrington⟶ 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]
 => [1]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [3]
 => 0
['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,1,1,1,1]
 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => [5,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]
 => [3,2,2,1,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]
 => [3,2,2,1,1]
 => 1
Description
The number of distinct even parts of a partition. See Section 3.3.1 of [1].
Matching statistic: St001172
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St001172: 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
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [1,0,1,0,1,0]
 => 0
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => 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]
 => 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
['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,1,1,0,1,0,0,1,0,0,1,0]
 => 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,1,1,0,1,0,0,1,0,0,1,0]
 => 1
Description
The number of 1-rises at odd height of a Dyck path.
Matching statistic: St001413
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00317: Integer partitions —odd parts⟶ Binary words
St001413: Binary words ⟶ ℤ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]
 => 01 => 0
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 11 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 11 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 101 => 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]
 => 111 => 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]
 => 111 => 1
Description
Half the length of the longest even length palindromic prefix of a binary word.
Matching statistic: St001424
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00317: Integer partitions —odd parts⟶ Binary words
St001424: Binary words ⟶ ℤ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]
 => 01 => 0
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 11 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 11 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 101 => 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]
 => 111 => 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]
 => 111 => 1
Description
The number of distinct squares in a binary word. A factor of a word is a sequence of consecutive letters. This statistic records the number of distinct non-empty words $u$ such that $uu$ is a factor of the word. Note that every word of length at least four contains a square.
Matching statistic: St001587
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00322: Integer partitions —Loehr-Warrington⟶ 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]
 => [1]
 => 0
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [3]
 => 0
['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,1,1,1,1]
 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => [5,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]
 => [3,2,2,1,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]
 => [3,2,2,1,1]
 => 1
Description
Half of the largest even part of an integer partition. The largest even part is recorded by [[St000995]].
The following 88 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001730The number of times the path corresponding to a binary word crosses the base line. St000897The number of different multiplicities of parts of an integer partition. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St001568The smallest positive integer that does not appear twice in the partition. St001354The number of series nodes in the modular decomposition of a graph. St001638The book thickness of a graph. St000286The number of connected components of the complement of a graph. St000482The (zero)-forcing number of a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St000274The number of perfect matchings of a graph. St000552The number of cut vertices of a graph. St001071The beta invariant of the graph. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001335The cardinality of a minimal cycle-isolating set of a graph. St001341The number of edges in the center of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001578The minimal number of edges to add or remove to make a graph a line graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001783The number of odd automorphisms of a graph. St000287The number of connected components of a graph. St000309The number of vertices with even degree. St000363The number of minimal vertex covers of a graph. St000553The number of blocks of a graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000916The packing number of a graph. St001282The number of graphs with the same chromatic polynomial. St001342The number of vertices in the center of a graph. St001716The 1-improper chromatic number of a graph. St001743The discrepancy of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001654The monophonic hull number of a graph. St000928The sum of the coefficients of the character polynomial of an integer partition. St000256The number of parts from which one can substract 2 and still get an integer partition. 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. St001570The minimal number of edges to add to make a graph Hamiltonian. St001118The acyclic chromatic index of a graph. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St000481The number of upper covers of a partition in dominance order. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001720The minimal length of a chain of small intervals in a lattice. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001002Number of indecomposable modules with projective and injective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001964The interval resolution global dimension of a poset. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000095The number of triangles of a graph. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000454The largest eigenvalue of a graph if it is integral. St000477The weight of a partition according to Alladi. St000478Another weight of a partition according to Alladi. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000741The Colin de Verdière graph invariant. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St001330The hat guessing number of a graph. St001624The breadth of a lattice. St001642The Prague dimension of a graph. St001734The lettericity of a graph. St001812The biclique partition number of a graph. St000567The sum of the products of all pairs of parts. St000668The least common multiple of the parts of the partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000708The product of the parts of an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000822The Hadwiger number of the graph. St000933The number of multipartitions of sizes given by an integer partition. St001128The exponens consonantiae of a partition. St000770The major index of an integer partition when read from bottom to top. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition.