Processing math: 100%

Your data matches 444 different statistics following compositions of up to 3 maps.
(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
['A',2]
=> 2
['B',2]
=> 3
['G',2]
=> 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)=ni=1di2+hdi=ni=1di+hdi where * W is the Weyl group of the given Cartan type, * n is the rank of W, * d1d2dn are the degrees of the fundamental invariants of W, * d1d2dn are the codegrees for W, see [2], and * h=dn 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: St000139
St000139: 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]
=> 4 = 3 + 1
['G',2]
=> 6 = 5 + 1
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: St000855
St000855: Finite Cartan types ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> 1 = 2 - 1
['B',2]
=> 2 = 3 - 1
['G',2]
=> 4 = 5 - 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 nh|W|d1dn1 where n is the rank, h is the Coxeter number, W is the Weyl group, and d1dn1dn=0 are the codegrees of the Weyl group of a Cartan type.
Matching statistic: St000857
St000857: 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]
=> 4 = 3 + 1
['G',2]
=> 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: St000858
St000858: 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]
=> 4 = 3 + 1
['G',2]
=> 6 = 5 + 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!hn/|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!32/6) factorizations of the Coxeter element (1,2,3)=(1,2)(2,3)=(1,3)(1,2)=(2,3)(1,3) in type A2.
Matching statistic: St001495
St001495: 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]
=> 4 = 3 + 1
['G',2]
=> 6 = 5 + 1
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: St001756
St001756: 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]
=> 4 = 3 + 1
['G',2]
=> 6 = 5 + 1
Description
The number of minimal subsets of reflections that generate the group.   This counts the number of minimal subsets SR of reflections RW that generate the group W.
Matching statistic: St001897
St001897: 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]
=> 4 = 3 + 1
['G',2]
=> 6 = 5 + 1
Description
The minimal degree of a faithful permutation representation of a Weyl group. Data are from [1, Table 1].
Matching statistic: St001945
St001945: Finite Cartan types ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> 4 = 2 + 2
['B',2]
=> 5 = 3 + 2
['G',2]
=> 7 = 5 + 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: St000138
St000138: Finite Cartan types ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',2]
=> 5 = 2 + 3
['B',2]
=> 6 = 3 + 3
['G',2]
=> 8 = 5 + 3
Description
The Catalan number of an irreducible finite Cartan type. The Catalan number of an irreducible finite Cartan type is defined as the product Cat(W)=ni=1di+hdi where *W is the Weyl group of the given Cartan type, * n is the rank of W, * d1d2dn are the degrees of the fundamental invariants of W, and * h=dn is the corresponding Coxeter number. The Catalan number Cat(W) counts various combinatorial objects, among which are * noncrossing partitions inside W, * antichains in the root poset, * regions within the fundamental chamber in the Shi arrangement, * dimensions of several modules in the context of the '''diagonal coininvariant ring''' and of '''rational Cherednik algebras'''. For a detailed treatment and further references, see [1].
The following 434 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000853The number of almost positive roots of a finite Cartan type. St001791The number of parabolic subgroups of the associated Weyl group. St000524The number of posets with the same order polynomial. St000525The number of posets with the same zeta polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000528The height of a poset. St000680The Grundy value for Hackendot on posets. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St000912The number of maximal antichains in a poset. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001343The dimension of the reduced incidence algebra of a poset. St001717The largest size of an interval in a poset. St000080The rank of the poset. St000189The number of elements in the poset. St000643The size of the largest orbit of antichains under Panyushev complementation. St000907The number of maximal antichains of minimal length in a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St000656The number of cuts of a poset. St001631The number of simple modules S with dimExt1(S,A)=1 in the incidence algebra A of the poset. 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. St000003The number of standard Young tableaux of the partition. St000081The number of edges of a graph. St000093The cardinality of a maximal independent set of vertices of a graph. St000147The largest part of an integer partition. St000184The size of the centralizer of any permutation of given cycle type. St000258The burning number 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. St000384The maximal part of the shifted composition of an integer partition. St000482The (zero)-forcing number of a graph. St000506The number of standard desarrangement tableaux of shape equal to the given partition. 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. St000567The sum of the products of all pairs of parts. St000668The least common multiple of the parts of the partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000708The product of the parts of an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000784The maximum of the length and the largest part of the integer partition. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000916The packing number of a graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001128The exponens consonantiae of a partition. St001279The sum of the parts of an integer partition that are at least two. St001286The annihilation 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. 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. St001389The number of partitions of the same length below the given integer partition. St001391The disjunction number of a graph. St001463The number of distinct columns in the nullspace of a graph. St001479The number of bridges of a graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St001615The number of join prime elements of a lattice. St001616The number of neutral elements in 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. 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. St001827The number of two-component spanning forests of a graph. St001828The Euler characteristic of a graph. St001829The common independence number of a graph. St001869The maximum cut size of a graph. 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. St000048The multinomial of the parts of a partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000145The Dyson rank of a partition. St000225Difference between largest and smallest parts in a partition. St000228The size of a partition. St000309The number of vertices with even degree. St000315The number of isolated vertices of a graph. St000380Half of the maximal perimeter of a rectangle fitting into the diagram 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. St000474Dyson's crank of a partition. St000479The Ramsey number of a graph. St000517The Kreweras number of an integer partition. St000531The leading coefficient of the rook polynomial of an integer partition. St000636The hull number of a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000778The metric dimension of a 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. 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. 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. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. 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. St001340The cardinality of a minimal non-edge isolating set of a graph. St001342The number of vertices in the center 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. St001571The Cartan determinant of the integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001619The number of non-isomorphic sublattices of a lattice. 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. St001666The number of non-isomorphic subposets of a lattice which are lattices. St001672The restrained domination number of a graph. St001691The number of kings in a graph. St001820The size of the image of the pop stack sorting operator. St001875The number of simple modules with projective dimension at most 1. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001949The rigidity index of a graph. St000477The weight of a partition according to Alladi. St000770The major index of an integer partition when read from bottom to top. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St001441The number of non-empty connected induced subgraphs of a graph. St001623The number of doubly irreducible elements of a lattice. St001651The Frankl number of a lattice. St001846The number of elements which do not have a complement in the lattice. St001527The cyclic permutation representation number of an integer partition. St000010The length of the partition. St000011The number of touch points (or returns) of a Dyck path. St000015The number of peaks of a Dyck path. St000059The inversion number of a standard tableau as defined by Haglund and Stevens. St000075The orbit size of a standard tableau under promotion. St000088The row sums of the character table of the symmetric group. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000169The cocharge of a standard tableau. St000171The degree of the graph. St000172The Grundy number of a graph. St000271The chromatic index of a graph. 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. St000330The (standard) major index of a standard tableau. St000363The number of minimal vertex covers of a graph. St000381The largest part of an integer composition. St000383The last part of an integer composition. St000439The position of the first down step of a Dyck path. St000507The number of ascents of a standard tableau. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000626The minimal period of a binary word. 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. St000681The Grundy value of Chomp on Ferrers diagrams. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000693The modular (standard) major index of a standard tableau. St000722The number of different neighbourhoods in a graph. St000734The last entry in the first row of a standard tableau. St000808The number of up steps of the associated bargraph. St000822The Hadwiger number of the graph. St000911The number of maximal antichains of maximal size in a poset. St000921The number of internal inversions of a binary word. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000937The number of positive values of the symmetric group character corresponding to the partition. St000946The sum of the skew hook positions in a 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. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001110The 3-dynamic chromatic number of a graph. St001116The game chromatic number of a graph. St001117The game chromatic index of a graph. St001118The acyclic chromatic index of a graph. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c0,c1,...,cn1] such that n=c0<ci 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=[c0,c1,...,cn1] such that n=c0<ci 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. 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. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001278The number of indecomposable modules that are fixed by τΩ1 composed with its inverse in the corresponding Nakayama algebra. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001311The cyclomatic number of a graph. St001313The number of Dyck paths above the lattice path given by a binary word. St001316The domatic number of a graph. St001317The minimal number of occurrences of the forest-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. St001345The Hamming dimension of a graph. 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. St001462The number of factors of a standard tableaux under concatenation. St001494The Alon-Tarsi number 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. St001530The depth of a Dyck path. St001541The Gini index of an integer partition. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001595The number of standard Young tableaux of the skew partition. St001670The connected partition number of a graph. St001697The shifted natural comajor index of a standard Young tableau. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001733The number of weak left to right maxima of a Dyck path. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001883The mutual visibility number of a graph. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St001963The tree-depth of a graph. St000005The bounce statistic of a Dyck path. St000013The height of a Dyck path. St000025The number of initial rises of a Dyck path. 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. St000144The pyramid weight of the Dyck path. St000148The number of odd parts of a partition. St000160The multiplicity of the smallest part of a partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000272The treewidth of a graph. St000293The number of inversions of a binary word. St000306The bounce count of a Dyck path. St000310The minimal degree of a vertex of a graph. St000312The number of leaves in a graph. St000327The number of cover relations in a poset. St000331The number of upper interactions of a Dyck path. St000362The size of a minimal vertex cover of a graph. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000377The dinv defect of an integer partition. St000393The number of strictly increasing runs in a binary word. St000395The sum of the heights of the peaks of a Dyck path. 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. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000536The pathwidth of a graph. St000548The number of different non-empty partial sums of an integer partition. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000667The greatest common divisor of the parts of the partition. St000674The number of hills of a Dyck path. 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. St000706The product of the factorials of the multiplicities of an integer partition. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000738The first entry in the last row of a standard tableau. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. St000744The length of the path to the largest entry in a standard Young tableau. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000815The number of semistandard Young tableaux of partition weight of given shape. St000816The number of standard composition tableaux of the composition. St000876The number of factors in the Catalan decomposition of a binary word. St000932The number of occurrences of the pattern UDU in a Dyck path. St000934The 2-degree of an integer partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000947The major index east count of a Dyck path. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) [c0,c1,...,cn1] by adding c0 to cn1. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama 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. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. 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. 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. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001034The area of the parallelogram polyomino associated with the Dyck path. St001057The Grundy value of the game of creating an independent set in a graph. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001091The number of parts in an integer partition whose next smaller part has the same size. St001102The number of words with multiplicities of the letters given by the composition, avoiding the consecutive pattern 132. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to 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. St001169Number of simple modules with projective dimension at least two 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. St001176The size of a partition minus its first part. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. 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. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001192The maximal dimension of Ext2A(S,A) for a simple module S over the corresponding Nakayama algebra A. St001197The global dimension of eAe for the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001199The dominant 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. 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. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. 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. 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. St001247The number of parts of a partition that are not congruent 2 modulo 3. 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. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. 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. St001308The number of induced paths on three vertices in a graph. St001312Number of parabolic noncrossing partitions indexed by the composition. St001323The independence gap of a graph. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001350Half of the Albertson index of a graph. St001358The largest degree of a regular subgraph of a graph. St001360The number of covering relations in Young's lattice below a partition. St001368The number of vertices of maximal degree in a graph. 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. St001459The number of zero columns in the nullspace 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. 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. St001498The normalised height of a Nakayama algebra with magnitude 1. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. 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. St001523The degree of symmetry of a Dyck path. St001586The number of odd parts smaller than the largest even part in an integer partition. St001637The number of (upper) dissectors of a poset. St001644The dimension of a graph. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001664The number of non-isomorphic subposets of a poset. St001668The number of points of the poset minus the width of the poset. St001674The number of vertices of the largest induced star graph in the 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. 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. 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. St001782The order of rowmotion on the set of order ideals of a poset. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. 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. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St001910The height of the middle non-run of a Dyck path. St001933The largest multiplicity of a part in an integer partition. St001962The proper pathwidth of a graph. St000024The number of double up and double down steps of a Dyck path. St000063The number of linear extensions of a certain poset defined for an integer partition. St000108The number of partitions contained in the given partition. St000290The major index of a binary word. St000313The number of degree 2 vertices of a graph. St000391The sum of the positions of the ones in a binary word. St000442The maximal area to the right of an up step of a Dyck path. St000456The monochromatic index of a connected graph. St000532The total number of rook placements on a Ferrers board. St000806The semiperimeter of the associated bargraph. St000867The sum of the hook lengths in the first row of an integer partition. 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. St000936The number of even values of the symmetric group character corresponding to the partition. St000941The number of characters of the symmetric group whose value on the partition is even. St000954Number of times the corresponding LNakayama algebra has Exti(D(A),A)=0 for i>0. 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. 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. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in 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. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. 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. St001126Number of simple module that are 1-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. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. 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. St001228The vector space dimension of the space of module homomorphisms between J and itself when J denotes the Jacobson radical of the corresponding Nakayama algebra. 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. 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 St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001254The vector space dimension of the first extension-group between A/soc(A) and J when A is the corresponding Nakayama algebra with Jacobson radical J. St001274The number of indecomposable injective modules with projective dimension equal to two. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001386The number of prime labellings of a graph. St001400The total number of Littlewood-Richardson tableaux of given shape. St001584The area statistic between a Dyck path and its bounce path. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St001795The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1). St001814The number of partitions interlacing the given partition. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St000300The number of independent sets of vertices of a graph. St000301The number of facets of the stable set polytope of a graph. St000915The Ore degree of a graph. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001127The sum of the squares of the parts of a partition. 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. St001688The sum of the squares of the heights of the peaks of a Dyck path. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition.