searching the database
Your data matches 193 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: St000140
St000140: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['B',2]
=> 3
['G',2]
=> 5
['A',3]
=> 5
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: St000857
St000857: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['B',2]
=> 4 = 3 + 1
['G',2]
=> 6 = 5 + 1
['A',3]
=> 6 = 5 + 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: St000912
(load all 2 compositions to match this statistic)
(load all 2 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
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 3
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> 5
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> 5
Description
The number of maximal antichains in a poset.
Matching statistic: St001300
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
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%
St001300: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 3
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> 5
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> 5
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 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
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%
St000189: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 4 = 3 + 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> 6 = 5 + 1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> 6 = 5 + 1
Description
The number of elements in the poset.
Matching statistic: St000656
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00148: Finite Cartan types —to root poset⟶ Posets
St000656: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000656: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> 5 = 3 + 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> 7 = 5 + 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> 7 = 5 + 2
Description
The number of cuts of a poset.
A cut is a subset $A$ of the poset such that the set of lower bounds of the set of upper bounds of $A$ is exactly $A$.
Matching statistic: St000452
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 5
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
Description
The number of distinct eigenvalues of a graph.
Matching statistic: St000550
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(2,1)],3)
=> 3
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 5
Description
The number of modular elements of a lattice.
A pair $(x, y)$ of elements of a lattice $L$ is a modular pair if for every $z\geq y$ we have that $(y\vee x) \wedge z = y \vee (x \wedge z)$. An element $x$ is left-modular if $(x, y)$ is a modular pair for every $y\in L$, and is modular if both $(x, y)$ and $(y, x)$ are modular pairs for every $y\in L$.
Matching statistic: St000551
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(2,1)],3)
=> 3
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 5
Description
The number of left modular elements of a lattice.
A pair $(x, y)$ of elements of a lattice $L$ is a modular pair if for every $z\geq y$ we have that $(y\vee x) \wedge z = y \vee (x \wedge z)$. An element $x$ is left-modular if $(x, y)$ is a modular pair for every $y\in L$.
Matching statistic: St000987
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Values
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 3
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 5
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 5
Description
The number of positive eigenvalues of the Laplacian matrix of the graph.
This is the number of vertices minus the number of connected components of the graph.
The following 183 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001093The detour number of a graph. St001279The sum of the parts of an integer partition that are at least two. St001389The number of partitions of the same length below the given integer partition. St001391The disjunction number of a graph. St001616The number of neutral elements in a lattice. St000228The size of a partition. St000259The diameter of a connected graph. St000309The number of vertices with even degree. St000918The 2-limited packing number of a graph. St001120The length of a longest path in a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001342The number of vertices in the center of a graph. St001458The rank of the adjacency matrix of a graph. St001512The minimum rank of 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. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001651The Frankl number of a lattice. St001846The number of elements which do not have a complement in the lattice. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St000313The number of degree 2 vertices of a graph. St000697The number of 3-rim hooks removed from an integer partition to obtain its associated 3-core. St000926The clique-coclique number of a graph. St000003The number of standard Young tableaux of the partition. St000145The Dyson rank of a partition. St000171The degree of the graph. St000271The chromatic index of a graph. St000277The number of ribbon shaped standard tableaux. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000384The maximal part of the shifted composition of an integer partition. St000482The (zero)-forcing number of a graph. St000553The number of blocks of a graph. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000681The Grundy value of Chomp on Ferrers diagrams. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000784The maximum of the length and the largest part of the integer partition. St000946The sum of the skew hook positions in a Dyck path. St001118The acyclic chromatic index of a graph. St001313The number of Dyck paths above the lattice path given by a binary word. St001343The dimension of the reduced incidence algebra of a poset. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. 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. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001717The largest size of an interval in a poset. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001780The order of promotion on the set of standard tableaux of given shape. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001883The mutual visibility number of a graph. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St000005The bounce statistic of a Dyck path. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000147The largest part of an integer partition. St000172The Grundy number of a graph. St000184The size of the centralizer of any permutation of given cycle type. St000293The number of inversions of a binary word. St000299The number of nonisomorphic vertex-induced subtrees. St000311The number of vertices of odd degree in a graph. St000362The size of a minimal vertex cover of a graph. St000377The dinv defect of an integer partition. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000395The sum of the heights of the peaks of a Dyck path. 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. St000474Dyson's crank of a partition. St000477The weight of a partition according to Alladi. St000479The Ramsey number of a graph. St000531The leading coefficient of the rook polynomial of an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000636The hull number of a graph. St000637The length of the longest cycle in a graph. St000667The greatest common divisor of the parts of the partition. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000718The largest Laplacian eigenvalue of a graph if it is integral. 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. St000770The major index of an integer partition when read from bottom to top. St000776The maximal multiplicity of an eigenvalue in a graph. St000778The metric dimension of a graph. St000822The Hadwiger number of the graph. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000915The Ore degree of a graph. St000934The 2-degree of an integer partition. St000947The major index east count of a Dyck path. St000953The largest degree of an irreducible factor of the Coxeter polynomial of the Dyck path over the rational numbers. St000992The alternating sum of the parts of an integer partition. St000995The largest even part of an integer partition. St000997The even-odd crank of an integer partition. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. 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. St001073The number of nowhere zero 3-flows of a graph. St001116The game chromatic number of a graph. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001248Sum of the even parts of a partition. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. 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. St001360The number of covering relations in Young's lattice below a partition. St001437The flex of a binary word. St001494The Alon-Tarsi number of a graph. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001586The number of odd parts smaller than the largest even part in an integer partition. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001670The connected partition number of a graph. 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. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001725The harmonious chromatic number of a graph. St001746The coalition number of a graph. St001933The largest multiplicity of a part in an integer partition. St001949The rigidity index of a graph. St000063The number of linear extensions of a certain poset defined for an integer partition. St000093The cardinality of a maximal independent set of vertices of a graph. St000108The number of partitions contained in the given partition. St000272The treewidth of a graph. St000387The matching number of a graph. St000388The number of orbits of vertices of a graph under automorphisms. St000532The total number of rook placements on a Ferrers board. St000536The pathwidth of a graph. St000618The number of self-evacuating tableaux of given shape. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000806The semiperimeter of the associated bargraph. St000936The number of even values of the symmetric group character corresponding to the partition. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001057The Grundy value of the game of creating an independent set in a graph. St001117The game chromatic index of a graph. St001277The degeneracy of a graph. St001282The number of graphs with the same chromatic polynomial. St001286The annihilation number of a graph. St001316The domatic number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001345The Hamming dimension of a graph. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001358The largest degree of a regular subgraph of a graph. St001400The total number of Littlewood-Richardson tableaux of given shape. St001463The number of distinct columns in the nullspace of a graph. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001734The lettericity of a graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001812The biclique partition number of a graph. St001814The number of partitions interlacing the given partition. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001955The number of natural descents for set-valued two row standard Young tableaux. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000447The number of pairs of vertices of a graph with distance 3. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001306The number of induced paths on four vertices in a graph. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001351The Albertson index of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. 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. 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. St001706The number of closed sets 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. St000455The second largest eigenvalue of a graph if it is integral.
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!