Your data matches 257 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 = 0 + 1
['A',2]
=> 1 = 0 + 1
['B',2]
=> 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: St000855
St000855: 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
Description
The number of full-support reflections in the Weyl group of a finite Cartan type. A reflection has full support if any (or all) reduced words for it in simple reflections use all simple reflections. This number is given by $\frac{nh}{|W|}d_1^*\cdots d_{n-1}^*$ where $n$ is the rank, $h$ is the Coxeter number, $W$ is the Weyl group, and $d_1^* \geq \ldots \geq d_{n-1}^* \geq d_n^* = 0$ are the codegrees of the Weyl group of a Cartan type.
Matching statistic: St001158
St001158: 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
Description
The size of the mutation class of quivers of given type.
Matching statistic: St001369
St001369: 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
Description
The largest coefficient in the highest root in the root system of a Cartan type.
Matching statistic: St001950
St001950: 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
Description
The minimal size of a base for the Weyl group of the Cartan type. A base of a permutation group is a set $B$ such that the pointwise stabilizer of $B$ is trivial. For example, a base of the symmetric group on $n$ letters must contain all but one letter. Any base has at least $\log |G|/n$ elements, where $n$ is the degree of the group, i.e., the size of its domain.
Mp00148: Finite Cartan types to root posetPosets
St001631: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',1]
=> ([],1)
=> 0
['A',2]
=> ([(0,2),(1,2)],3)
=> 0
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 1
Description
The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset.
Mp00148: Finite Cartan types to root posetPosets
St001964: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',1]
=> ([],1)
=> 0
['A',2]
=> ([(0,2),(1,2)],3)
=> 0
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 1
Description
The interval resolution global dimension of a poset. This is the cardinality of the longest chain of right minimal approximations by interval modules of an indecomposable module over the incidence algebra.
Mp00148: Finite Cartan types to root posetPosets
St000907: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',1]
=> ([],1)
=> 1 = 0 + 1
['A',2]
=> ([(0,2),(1,2)],3)
=> 1 = 0 + 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 2 = 1 + 1
Description
The number of maximal antichains of minimal length in a poset.
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
St000145: 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]
=> 0
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> 1
Description
The Dyson rank of a partition. This rank is defined as the largest part minus the number of parts. It was introduced by Dyson [1] in connection to Ramanujan's partition congruences $$p(5n+4) \equiv 0 \pmod 5$$ and $$p(7n+6) \equiv 0 \pmod 7.$$
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
St000149: 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]
=> 0
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> 1
Description
The number of cells of the partition whose leg is zero and arm is odd. This statistic is equidistributed with [[St000143]], see [1].
The following 247 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000256The number of parts from which one can substract 2 and still get an integer partition. St000377The dinv defect of an integer partition. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St001307The number of induced stars on four vertices in a graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001578The minimal number of edges to add or remove to make a graph a line graph. St001623The number of doubly irreducible elements of a lattice. St001638The book thickness of a graph. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001846The number of elements which do not have a complement in the lattice. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St000088The row sums of the character table of the symmetric group. St000142The number of even parts of a partition. St000148The number of odd parts of a partition. St000309The number of vertices with even degree. St000315The number of isolated vertices of a graph. St000480The number of lower covers of a partition in dominance order. St000482The (zero)-forcing number of a graph. St000531The leading coefficient of the rook polynomial of an integer partition. St000723The maximal cardinality of a set of vertices with the same neighbourhood in 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. St000776The maximal multiplicity of an eigenvalue in a graph. St000785The number of distinct colouring schemes of a graph. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. 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. St001092The number of distinct even parts of a partition. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001282The number of graphs with the same chromatic polynomial. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001571The Cartan determinant of the integer partition. St001587Half of the largest even part of an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001691The number of kings in a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001820The size of the image of the pop stack sorting operator. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000024The number of double up and double down steps of a Dyck path. St000052The number of valleys of a Dyck path not on the x-axis. St000091The descent variation of a composition. St000095The number of triangles of a graph. St000143The largest repeated part of a partition. St000150The floored half-sum of the multiplicities of a partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000225Difference between largest and smallest parts in a partition. St000257The number of distinct parts of a partition that occur at least twice. St000295The length of the border of a binary word. St000386The number of factors DDU in a Dyck path. St000442The maximal area to the right of an up step of a Dyck path. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000481The number of upper covers of a partition in dominance order. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000547The number of even non-empty partial sums of an integer partition. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000671The maximin edge-connectivity for choosing a subgraph. St000761The number of ascents in an integer composition. St000766The number of inversions of an integer composition. St000768The number of peaks in an integer composition. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000874The position of the last double rise in a Dyck path. St000877The depth of the binary word interpreted as a path. St000885The number of critical steps in the Catalan decomposition of a binary word. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000976The sum of the positions of double up-steps of a Dyck path. 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. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the 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. St001031The height of the bicoloured Motzkin path associated with 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. St001071The beta invariant of the graph. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001091The number of parts in an integer partition whose next smaller part has the same size. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001137Number of simple modules that are 3-regular in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive 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. St001214The aft of an integer partition. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001252Half the sum of the even parts of a partition. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001280The number of parts of an integer partition that are at least two. St001310The number of induced diamond graphs in a graph. St001311The cyclomatic number 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. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001335The cardinality of a minimal cycle-isolating set of a graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001341The number of edges in the center 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. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001524The degree of symmetry of a binary word. 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. St001584The area statistic between a Dyck path and its bounce path. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001657The number of twos in an integer partition. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001718The number of non-empty open intervals in a poset. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001730The number of times the path corresponding to a binary word crosses the base line. St001736The total number of cycles in a graph. St001797The number of overfull subgraphs of a graph. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001930The weak major index of a binary word. St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition. St000013The height of a Dyck path. St000025The number of initial rises of a Dyck path. St000047The number of standard immaculate tableaux of a given shape. St000079The number of alternating sign matrices for a given Dyck path. St000120The number of left tunnels of a Dyck path. St000159The number of distinct parts of the integer partition. St000160The multiplicity of the smallest part of a partition. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000288The number of ones in a binary word. St000381The largest part of an integer composition. St000392The length of the longest run of ones in a binary word. St000393The number of strictly increasing runs in a binary word. St000443The number of long tunnels of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000445The number of rises of length 1 of a Dyck path. St000475The number of parts equal to 1 in a partition. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000549The number of odd partial sums of an integer partition. St000627The exponent of a binary word. St000631The number of distinct palindromic decompositions of a binary word. St000753The Grundy value for the game of Kayles on a binary word. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000758The length of the longest staircase fitting into an integer composition. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000764The number of strong records in an integer composition. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000783The side length of the largest staircase partition fitting into a partition. St000808The number of up steps of the associated bargraph. St000816The number of standard composition tableaux of the composition. St000876The number of factors in the Catalan decomposition of a binary word. St000897The number of different multiplicities of parts of an integer partition. St000903The number of different parts of an integer composition. St000905The number of different multiplicities of parts of an integer composition. St000913The number of ways to refine the partition into singletons. St000922The minimal number such that all substrings of this length are unique. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000982The length of the longest constant subword. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001249Sum of the odd parts of a partition. St001267The length of the Lyndon factorization of the binary word. 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. St001342The number of vertices in the center of a graph. St001368The number of vertices of maximal degree in a graph. St001372The length of a longest cyclic run of ones of a binary word. St001415The length of the longest palindromic prefix of a binary word. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001432The order dimension of the partition. St001437The flex of a binary word. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001479The number of bridges of a graph. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001498The normalised height of a Nakayama algebra with magnitude 1. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001523The degree of symmetry of a Dyck path. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001624The breadth of a lattice. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001716The 1-improper chromatic number of a graph. St001739The number of graphs with the same edge polytope as the given graph. St001743The discrepancy of a graph. St001783The number of odd automorphisms of a graph. St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. St001809The index of the step at the first peak of maximal height in a Dyck path. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001826The maximal number of leaves on a vertex of a graph. St001881The number of factors of a lattice as a Cartesian product of lattices. St001884The number of borders of a binary word. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001949The rigidity index of a graph. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000439The position of the first down step of a Dyck path. St000469The distinguishing number of a graph. St000626The minimal period of a binary word. St000636The hull number of a graph. St001315The dissociation number of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001654The monophonic hull number of a graph. St001672The restrained domination number of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001002Number of indecomposable modules with projective and injective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra.