Your data matches 162 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000857
Mapping
St000857: 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]
 => 3 = 2 + 1
['B',2]
 => 4 = 3 + 1
Description
The number of reflections of the Weyl group of a finite Cartan type. By the one-to-one correspondence between reflections and reflecting hyperplanes, this is also the number of reflecting hyperplanes. This is given by $nh/2$ where $n$ is the rank and $h$ is the Coxeter number.
Matching statistic: St000858
Mapping
St000858: 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]
 => 3 = 2 + 1
['B',2]
 => 4 = 3 + 1
Description
The number of factorizations of any Coxeter element into reflections of a finite Cartan type. The number of such factorizations is given by $n!h^n / |W|$ where $n$ is the rank, $h$ is the Coxeter number and $W$ is the Weyl group of the given Cartan type. This was originally proven in a letter from Deligne to Looijenga in the 1970s, and then recovered in [2, Theorem 3.6]. As an example, consider the three ($=2!3^2/6$) factorizations of the Coxeter element $$(1,2,3) = (1,2)(2,3) = (1,3)(1,2) = (2,3)(1,3)$$ in type $A_2$.
Matching statistic: St001700
Mapping
St001700: 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]
 => 3 = 2 + 1
['B',2]
 => 4 = 3 + 1
Description
The maximum degree of the Hasse diagram of the strong Bruhat order in the Weyl group of the Cartan type.
Matching statistic: St001756
Mapping
St001756: 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]
 => 3 = 2 + 1
['B',2]
 => 4 = 3 + 1
Description
The number of minimal subsets of reflections that generate the group. $~$ This counts the number of minimal subsets $S \subseteq R$ of reflections $R \subseteq W$ that generate the group $W$.
Matching statistic: St001945
Mapping
St001945: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => 2 = 0 + 2
['A',2]
 => 4 = 2 + 2
['B',2]
 => 5 = 3 + 2
Description
The number of non-isomorphic subgroups of the Weyl group of a finite Cartan type. This statistic returns the number of non-isomorphic abstract groups. See [[St001155]] for the number of conjugacy classes of subgroups.
Matching statistic: St001300
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
St001300: 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)
 => 2
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => 3
Description
The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset.
Matching statistic: St000189
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
St000189: 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)
 => 3 = 2 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => 4 = 3 + 1
Description
The number of elements in the poset.
Matching statistic: St001636
(load all 2 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
St001636: 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)
 => 3 = 2 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => 4 = 3 + 1
Description
The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset.
Matching statistic: St000081
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St000081: Graphs ⟶ ℤ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)
 => ([(0,2),(1,2)],3)
 => 2
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 3
Description
The number of edges of a graph.
Matching statistic: St000171
(load all 4 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
St000171: Graphs ⟶ ℤ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)
 => ([(0,2),(1,2)],3)
 => 2
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => 3
Description
The degree of the graph. This is the maximal vertex degree of a graph.
The following 152 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000312The number of leaves in a graph. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001117The game chromatic index of a graph. St001279The sum of the parts of an integer partition that are at least two. St001345The Hamming dimension of a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001391The disjunction number of a graph. St001479The number of bridges of a graph. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001622The number of join-irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001708The number of pairs of vertices of different degree in a graph. St001826The maximal number of leaves on a vertex of a graph. St001827The number of two-component spanning forests of a graph. St001869The maximum cut size of a graph. St000048The multinomial of the parts of a partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000086The number of subgraphs. St000228The size of a partition. St000299The number of nonisomorphic vertex-induced subtrees. St000349The number of different adjacency matrices of a graph. St000378The diagonal inversion number of an integer partition. St000459The hook length of the base cell of a partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000468The Hosoya index of a graph. St000479The Ramsey number of a graph. St000517The Kreweras number of an integer partition. St000636The hull number of a graph. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000917The open packing number of a graph. St000918The 2-limited packing number of a graph. St000939The number of characters of the symmetric group whose value on the partition is positive. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001110The 3-dynamic chromatic number of a graph. St001315The dissociation 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. St001342The number of vertices in the center of a graph. St001463The number of distinct columns in the nullspace of a graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001672The restrained domination number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001725The harmonious chromatic number of a graph. St001746The coalition number of a graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St000937The number of positive values of the symmetric group character corresponding to the partition. St000059The inversion number of a standard tableau as defined by Haglund and Stevens. St000095The number of triangles of a graph. St000145The Dyson rank of a partition. St000169The cocharge of a standard tableau. St000309The number of vertices with even degree. St000313The number of degree 2 vertices of a graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000330The (standard) major index of a standard tableau. St000344The number of strongly connected outdegree sequences of a graph. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000921The number of internal inversions of a binary word. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001311The cyclomatic number of a graph. 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. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001458The rank of the adjacency matrix of a graph. St001459The number of zero columns in the nullspace of a graph. St001541The Gini index of an integer partition. St001692The number of vertices with higher degree than the average degree in a graph. St001697The shifted natural comajor index of a standard Young tableau. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001742The difference of the maximal and the minimal degree in 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. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000144The pyramid weight of the Dyck path. St000147The largest part of an integer partition. St000184The size of the centralizer of any permutation of given cycle type. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000271The chromatic index of a graph. St000293The number of inversions of a binary word. St000384The maximal part of the shifted composition of an integer partition. St000395The sum of the heights of the peaks of a Dyck path. St000450The number of edges minus the number of vertices plus 2 of a graph. St000452The number of distinct eigenvalues of a graph. St000531The leading coefficient of the rook polynomial of an integer partition. St000537The cutwidth of a graph. St000548The number of different non-empty partial sums of an integer partition. St000631The number of distinct palindromic decompositions of a binary word. St000667The greatest common divisor of the parts of the partition. St000722The number of different neighbourhoods in a graph. St000734The last entry in the first row of a standard tableau. St000738The first entry in the last row of a standard tableau. St000784The maximum of the length and the largest part of the integer partition. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000847The number of standard Young tableaux whose descent set is the binary word. St000947The major index east count of a Dyck path. St000992The alternating sum of the parts of an integer partition. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001034The area of the parallelogram polyomino associated with the Dyck path. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001102The number of words with multiplicities of the letters given by the composition, avoiding the consecutive pattern 132. St001118The acyclic chromatic index of a graph. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001176The size of a partition minus its first part. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001249Sum of the odd parts of a partition. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001281The normalized isoperimetric number of a graph. St001312Number of parabolic noncrossing partitions indexed by the composition. St001360The number of covering relations in Young's lattice below a partition. St001389The number of partitions of the same length below the given integer partition. 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. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. 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. St001917The order of toric promotion on the set of labellings of a graph. St000063The number of linear extensions of a certain poset defined for an integer partition. St000108The number of partitions contained in the given partition. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000532The total number of rook placements on a Ferrers board. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001400The total number of Littlewood-Richardson tableaux of given shape. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St001814The number of partitions interlacing the given partition. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001706The number of closed sets in a graph.