Your data matches 215 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001701
St001701: Finite Cartan types ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> 2
['B',2]
=> 2
['G',2]
=> 2
['A',3]
=> 4
Description
The maximum down-degree of the Hasse diagram of the strong Bruhat order in the Weyl group of the Cartan type.
Matching statistic: St001788
St001788: Finite Cartan types ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> 3 = 2 + 1
['B',2]
=> 3 = 2 + 1
['G',2]
=> 3 = 2 + 1
['A',3]
=> 5 = 4 + 1
Description
The number of types of parabolic subgroups of the associated Weyl group. Let $W$ be a Weyl group with simple generators $\mathcal{S} \subseteq W$. A subgroup of $W$ generated by a subset $X \subseteq \mathcal{S}$ is called standard parabolic subgroup. A parabolic subgroup is a subgroup of $W$ that is conjugate to a standard parabolic subgroup. This is the number of all pairwise different types of subgroups of $W$ obtained as (standard) parabolic subgroups (including type $A_0$).
Mp00148: Finite Cartan types to root posetPosets
St000071: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> 2
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> 4
Description
The number of maximal chains in a poset.
Mp00148: Finite Cartan types to root posetPosets
St000909: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> 2
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> 4
Description
The number of maximal chains of maximal size in a poset.
Mp00148: Finite Cartan types to root posetPosets
St000910: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> 2
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> 4
Description
The number of maximal chains of minimal length in a poset.
Mp00148: Finite Cartan types to root posetPosets
St001902: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> 2
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> 4
Description
The number of potential covers of a poset. A potential cover is a pair of uncomparable elements $(x, y)$ which can be added to the poset without adding any other relations. For example, let $P$ be the disjoint union of a single relation $(1, 2)$ with the one element poset $0$. Then the relation $(0, 1)$ cannot be added without adding also $(0, 2)$, however, the relations $(0, 2)$ and $(1, 0)$ are potential covers.
Mp00148: Finite Cartan types to root posetPosets
St001095: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> 0 = 2 - 2
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 0 = 2 - 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> 0 = 2 - 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> 2 = 4 - 2
Description
The number of non-isomorphic posets with precisely one further covering relation.
Mp00148: Finite Cartan types to root posetPosets
Mp00198: Posets incomparability graphGraphs
St000299: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 2
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> 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)
=> 4
Description
The number of nonisomorphic vertex-induced subtrees.
Mp00148: Finite Cartan types to root posetPosets
Mp00198: Posets incomparability graphGraphs
St000363: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 2
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> 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)
=> 4
Description
The number of minimal vertex covers of a graph. A '''vertex cover''' of a graph $G$ is a subset $S$ of the vertices of $G$ such that each edge of $G$ contains at least one vertex of $S$. A vertex cover is minimal if it contains the least possible number of vertices. This is also the leading coefficient of the clique polynomial of the complement of $G$. This is also the number of independent sets of maximal cardinality of $G$.
Mp00148: Finite Cartan types to root posetPosets
Mp00198: Posets incomparability graphGraphs
St000388: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 2
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> 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)
=> 4
Description
The number of orbits of vertices of a graph under automorphisms.
The following 205 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001093The detour number of a graph. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001108The 2-dynamic chromatic number of a graph. St001119The length of a shortest maximal path in a graph. St001304The number of maximally independent sets of vertices of a graph. St001458The rank of the adjacency matrix of a graph. St001963The tree-depth of a graph. St000171The degree of the graph. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000271The chromatic index of a graph. St000362The size of a minimal vertex cover of a graph. St000452The number of distinct eigenvalues of a graph. St000537The cutwidth of a graph. St000547The number of even non-empty partial sums of an integer partition. St000948The chromatic discriminant of a graph. St001112The 3-weak dynamic number of a graph. St001118The acyclic chromatic index of a graph. St001176The size of a partition minus its first part. St001214The aft of an integer partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. 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). St001512The minimum rank of a graph. St001574The minimal number of edges to add or remove to make a graph regular. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001694The number of maximal dissociation sets in a graph. St001742The difference of the maximal and the minimal degree in a graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001961The sum of the greatest common divisors of all pairs of parts. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000344The number of strongly connected outdegree sequences of a graph. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001073The number of nowhere zero 3-flows of a graph. St001306The number of induced paths on four vertices in a graph. 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. St001350Half of the Albertson index of a graph. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001618The cardinality of the Frattini sublattice of a lattice. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001689The number of celebrities in a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000295The length of the border of a binary word. St000378The diagonal inversion number of an integer partition. St000511The number of invariant subsets when acting with a permutation of given cycle type. St000738The first entry in the last row of a standard tableau. St000915The Ore degree of a graph. St000935The number of ordered refinements of an integer partition. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001280The number of parts of an integer partition that are at least two. St001286The annihilation number of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001315The dissociation number of a graph. St001391The disjunction number of a graph. St001463The number of distinct columns in the nullspace of a graph. St001725The harmonious chromatic number of a graph. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001814The number of partitions interlacing the given partition. St000048The multinomial of the parts of a partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000179The product of the hook lengths of the integer partition. St000182The number of permutations whose cycle type is the given integer partition. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000228The size of a partition. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000450The number of edges minus the number of vertices plus 2 of a graph. St000456The monochromatic index of a connected graph. 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. St000517The Kreweras number of an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000691The number of changes of a binary word. St000785The number of distinct colouring schemes of a graph. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001071The beta invariant of the graph. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St001117The game chromatic index of a graph. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. 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. St001345The Hamming dimension of a graph. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001480The number of simple summands of the module J^2/J^3. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001692The number of vertices with higher degree than the average degree in a graph. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001712The number of natural descents of a standard Young tableau. St001716The 1-improper chromatic number of a graph. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001792The arboricity of a graph. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St000095The number of triangles of a graph. St000117The number of centered tunnels of a Dyck path. St000149The number of cells of the partition whose leg is zero and arm is odd. St000403The Szeged index minus the Wiener index of a graph. St000447The number of pairs of vertices of a graph with distance 3. St000478Another weight of a partition according to Alladi. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000995The largest even part of an integer partition. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. 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. St001351The Albertson index of a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001395The number of strictly unfriendly partitions of a graph. St001500The global dimension of magnitude 1 Nakayama algebras. St001541The Gini index of an integer partition. St001584The area statistic between a Dyck path and its bounce path. St001647The number of edges that can be added without increasing the clique number. St001648The number of edges that can be added without increasing the chromatic number. St001783The number of odd automorphisms 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. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001472The permanent of the Coxeter matrix of the poset. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. St000146The Andrews-Garvan crank of a partition. St000159The number of distinct parts of the integer partition. St000185The weighted size of a partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000307The number of rowmotion orbits of a poset. St000346The number of coarsenings of a partition. St000422The energy of a graph, if it is integral. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000783The side length of the largest staircase partition fitting into a partition. St000810The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to monomial symmetric functions. St001330The hat guessing number of a graph. St001432The order dimension of the partition. St000160The multiplicity of the smallest part of a partition. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000454The largest eigenvalue of a graph if it is integral. St000481The number of upper covers of a partition in dominance order. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000706The product of the factorials of the multiplicities of an integer partition. St000759The smallest missing part in an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000814The sum of the entries in the column specified by the partition of the change of basis matrix from elementary symmetric functions to Schur symmetric functions. St000897The number of different multiplicities of parts of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001568The smallest positive integer that does not appear twice in the partition. St001644The dimension of a graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000143The largest repeated part of a partition. St000455The second largest eigenvalue of a graph if it is integral. St000475The number of parts equal to 1 in a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000811The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to Schur symmetric functions. St000929The constant term of the character polynomial of an integer partition. St001091The number of parts in an integer partition whose next smaller part has the same size. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St000142The number of even parts of a partition. St000183The side length of the Durfee square of an integer partition. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000668The least common multiple of the parts of the partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001128The exponens consonantiae of a partition. St001252Half the sum of the even parts of a partition. St001703The villainy of a graph. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000321The number of integer partitions of n that are dominated by an integer partition. St000345The number of refinements of a partition. St000480The number of lower covers of a partition in dominance order. St000667The greatest common divisor of the parts of the partition. St000913The number of ways to refine the partition into singletons. St001092The number of distinct even parts of a partition. St001271The competition number of a graph. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001571The Cartan determinant of the integer partition. St001638The book thickness of a graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000256The number of parts from which one can substract 2 and still get an integer partition. St000477The weight of a partition according to Alladi. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001002Number of indecomposable modules with projective and injective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001834The number of non-isomorphic minors of a graph. St001129The product of the squares of the parts of a partition.