searching the database
Your data matches 258 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000139
St000139: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
=> 2
['A',2]
=> 3
['B',2]
=> 4
Description
The Coxeter number of a finite Cartan type.
The Coxeter number $h$ for the Weyl group $W$ of the given finite Cartan type is defined as the order of the product of the Coxeter generators of $W$. Equivalently, this is equal to the maximal degree of a fundamental invariant of $W$, see also [[St000138]].
Matching statistic: St001150
St001150: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
=> 2
['A',2]
=> 3
['B',2]
=> 4
Description
The minimal dimension of a faithful linear representation of the Lie algebra of given type.
Matching statistic: St001495
St001495: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
=> 2
['A',2]
=> 3
['B',2]
=> 4
Description
The maximal order of an element in the Weyl group of a given Cartan type.
For the symmetric group, this is [[oeis:A000793]]
Matching statistic: St001789
St001789: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
=> 2
['A',2]
=> 3
['B',2]
=> 4
Description
The number of types of reflection subgroups of the associated Weyl group.
Let $\mathcal{R} \subseteq W$ be the set of reflections in the Weyl group $W$.
A (possibly empty) subset $X \subseteq \mathcal{R}$ generates a subgroup of $W$ that is again a reflection group of some (not necessarily reduced) finite type. This is the number of all pairwise different types of subgroups of $W$ obtained this way (including type $A_0$).
Matching statistic: St001897
St001897: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
=> 2
['A',2]
=> 3
['B',2]
=> 4
Description
The minimal degree of a faithful permutation representation of a Weyl group.
Data are from [1, Table 1].
Matching statistic: St000140
St000140: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
=> 1 = 2 - 1
['A',2]
=> 2 = 3 - 1
['B',2]
=> 3 = 4 - 1
Description
The positive Catalan number of an irreducible finite Cartan type.
The positive Catalan number of an irreducible finite Cartan type is defined as the product
$$ Cat^+(W) = \prod_{i=1}^n \frac{d_i-2+h}{d_i} = \prod_{i=1}^n \frac{d^*_i+h}{d_i}$$
where
* $W$ is the Weyl group of the given Cartan type,
* $n$ is the rank of $W$,
* $d_1 \leq d_2 \leq \ldots \leq d_n$ are the degrees of the fundamental invariants of $W$,
* $d^*_1 \geq d^*_2 \geq \ldots \geq d^*_n$ are the codegrees for $W$, see [2], and
* $h = d_n$ is the corresponding Coxeter number.
The positive Catalan number $Cat^+(W)$ counts various combinatorial objects, among which are
* noncrossing partitions of full Coxeter support inside $W$,
* antichains not containing simple roots in the root poset,
* bounded regions within the fundamental chamber in the Shi arrangement.
For a detailed treatment and further references, see [1].
Matching statistic: St000528
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00148: Finite Cartan types —to root poset⟶ Posets
St000528: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000528: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
=> ([],1)
=> 1 = 2 - 1
['A',2]
=> ([(0,2),(1,2)],3)
=> 2 = 3 - 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 3 = 4 - 1
Description
The height of a poset.
This equals the rank of the poset [[St000080]] plus one.
Matching statistic: St000912
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00148: Finite Cartan types —to root poset⟶ Posets
St000912: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000912: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
=> ([],1)
=> 1 = 2 - 1
['A',2]
=> ([(0,2),(1,2)],3)
=> 2 = 3 - 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 3 = 4 - 1
Description
The number of maximal antichains in a poset.
Matching statistic: St001343
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00148: Finite Cartan types —to root poset⟶ Posets
St001343: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001343: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
=> ([],1)
=> 1 = 2 - 1
['A',2]
=> ([(0,2),(1,2)],3)
=> 2 = 3 - 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 3 = 4 - 1
Description
The dimension of the reduced incidence algebra of a poset.
The reduced incidence algebra of a poset is the subalgebra of the incidence algebra consisting of the elements which assign the same value to any two intervals that are isomorphic to each other as posets.
Thus, this statistic returns the number of non-isomorphic intervals of the poset.
Matching statistic: St001717
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00148: Finite Cartan types —to root poset⟶ Posets
St001717: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001717: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
=> ([],1)
=> 1 = 2 - 1
['A',2]
=> ([(0,2),(1,2)],3)
=> 2 = 3 - 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 3 = 4 - 1
Description
The largest size of an interval in a poset.
The following 248 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000080The rank of the poset. St000147The largest part of an integer partition. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000384The maximal part of the shifted composition of an integer partition. St000474Dyson's crank of a partition. St000784The maximum of the length and the largest part of the integer partition. St001619The number of non-isomorphic sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St000003The number of standard Young tableaux of the partition. St000093The cardinality of a maximal independent set of vertices of a graph. St000184The size of the centralizer of any permutation of given cycle type. St000258The burning number of a graph. St000271The chromatic index of a graph. St000273The domination number of a graph. St000287The number of connected components of a graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000345The number of refinements of a partition. St000469The distinguishing number of a graph. St000482The (zero)-forcing number of a graph. St000544The cop number of a graph. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000553The number of blocks of a graph. St000636The hull number of a graph. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000916The packing number of a graph. St000935The number of ordered refinements of an integer partition. St001112The 3-weak dynamic number of a graph. St001286The annihilation number of a graph. St001315The dissociation number of a graph. St001322The size of a minimal independent dominating set in a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001366The maximal multiplicity of a degree of a vertex of a graph. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001389The number of partitions of the same length below the given integer partition. St001463The number of distinct columns in the nullspace of a graph. St001616The number of neutral elements in a lattice. St001642The Prague dimension of a graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001720The minimal length of a chain of small intervals in a lattice. St001780The order of promotion on the set of standard tableaux of given shape. St001828The Euler characteristic of a graph. St001829The common independence number of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001883The mutual visibility number of a graph. 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. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001917The order of toric promotion on the set of labellings of a graph. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St000225Difference between largest and smallest parts in a partition. St000537The cutwidth of a graph. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000778The metric dimension of a graph. St001270The bandwidth of a graph. St001323The independence gap of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001398Number of subsets of size 3 of elements in a poset that form a "v". St001521Half the total irregularity 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. St001644The dimension of a graph. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001742The difference of the maximal and the minimal degree in a graph. 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. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001949The rigidity index of a graph. St001961The sum of the greatest common divisors of all pairs of parts. St001962The proper pathwidth of a graph. St000010The length of the partition. St000070The number of antichains in a poset. St000104The number of facets in the order polytope of this poset. St000151The number of facets in the chain polytope of the poset. St000299The number of nonisomorphic vertex-induced subtrees. St000393The number of strictly increasing runs in a binary word. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001034The area of the parallelogram polyomino associated with the Dyck path. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. 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. St001180Number of indecomposable injective modules with projective dimension at most 1. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. 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. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001664The number of non-isomorphic subposets of a poset. St001674The number of vertices of the largest induced star graph in the graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001782The order of rowmotion on the set of order ideals of a poset. St000011The number of touch points (or returns) of a Dyck path. St000015The number of peaks of a Dyck path. St000075The orbit size of a standard tableau under promotion. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000172The Grundy number of a graph. St000189The number of elements in the poset. St000277The number of ribbon shaped standard tableaux. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000286The number of connected components of the complement of a graph. St000363The number of minimal vertex covers of a graph. St000381The largest part of an integer composition. St000383The last part of an integer composition. St000391The sum of the positions of the ones in a binary word. St000507The number of ascents of a standard tableau. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000547The number of even non-empty partial sums of an integer partition. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000676The number of odd rises of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000722The number of different neighbourhoods in a graph. St000734The last entry in the first row of a standard tableau. St000741The Colin de Verdière graph invariant. St000792The Grundy value for the game of ruler on a binary word. St000808The number of up steps of the associated bargraph. St000822The Hadwiger number of the graph. St000907The number of maximal antichains of minimal length in a poset. St000911The number of maximal antichains of maximal size in a poset. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001116The game chromatic number of a graph. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows:
St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001313The number of Dyck paths above the lattice path given by a binary word. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001368The number of vertices of maximal degree in a graph. St001391The disjunction number of a graph. St001462The number of factors of a standard tableaux under concatenation. St001494The Alon-Tarsi number of a graph. St001512The minimum rank of a graph. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001530The depth of a Dyck path. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001595The number of standard Young tableaux of the skew partition. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St001670The connected partition number of a graph. St001725The harmonious chromatic number of a graph. St001733The number of weak left to right maxima of a Dyck path. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001915The size of the component corresponding to a necklace in Bulgarian solitaire. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St001955The number of natural descents for set-valued two row standard Young tableaux. St001963The tree-depth of a graph. St000053The number of valleys of the Dyck path. St000057The Shynar inversion number of a standard tableau. St000089The absolute variation of a composition. St000090The variation of a composition. St000091The descent variation of a composition. St000120The number of left tunnels of a Dyck path. St000149The number of cells of the partition whose leg is zero and arm is odd. St000171The degree of the graph. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000272The treewidth of a graph. St000306The bounce count of a Dyck path. St000310The minimal degree of a vertex of a graph. St000313The number of degree 2 vertices of a graph. St000331The number of upper interactions of a Dyck path. St000362The size of a minimal vertex cover of a graph. St000377The dinv defect of an integer partition. St000387The matching number of a graph. St000454The largest eigenvalue of a graph if it is integral. St000536The pathwidth of a graph. St000682The Grundy value of Welter's game on a binary word. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. 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. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001120The length of a longest path in a graph. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001176The size of a partition minus its first part. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001277The degeneracy of a graph. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001308The number of induced paths on three vertices in a graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001350Half of the Albertson index of a graph. St001358The largest degree of a regular subgraph of a graph. St001459The number of zero columns in the nullspace of a graph. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001586The number of odd parts smaller than the largest even part in an integer partition. St001613The binary logarithm of the size of the center of a lattice. St001621The number of atoms of a lattice. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001638The book thickness of a graph. 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. St001689The number of celebrities in a graph. St001692The number of vertices with higher degree than the average degree in a graph. St001695The natural comajor index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001743The discrepancy of a graph. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001792The arboricity of a graph. St001795The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1). St001812The biclique partition number of a graph. St001869The maximum cut size of a graph. St001910The height of the middle non-run of a Dyck path.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!