searching the database
Your data matches 641 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: St000081
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([],1)
=> 0
([],2)
=> 0
([(0,1)],2)
=> 1
([],3)
=> 0
([(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 3
Description
The number of edges of a graph.
Matching statistic: St001117
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Values
([],1)
=> 0
([],2)
=> 0
([(0,1)],2)
=> 1
([],3)
=> 0
([(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 3
Description
The game chromatic index of a graph.
Two players, Alice and Bob, take turns colouring properly any uncolored edge of the graph. Alice begins. If it is not possible for either player to colour a edge, then Bob wins. If the graph is completely colored, Alice wins.
The game chromatic index is the smallest number of colours such that Alice has a winning strategy.
Matching statistic: St001649
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([],1)
=> 0
([],2)
=> 0
([(0,1)],2)
=> 1
([],3)
=> 0
([(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 3
Description
The length of a longest trail in a graph.
A trail is a sequence of distinct edges, such that two consecutive edges share a vertex.
Matching statistic: St000086
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 1 = 0 + 1
([(0,1)],2)
=> 2 = 1 + 1
([],3)
=> 1 = 0 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,1),(0,2),(1,2)],3)
=> 4 = 3 + 1
Description
The number of subgraphs.
Given a graph $G$, this is the number of graphs $H$ such that $H \hookrightarrow G$.
Matching statistic: St000468
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 1 = 0 + 1
([(0,1)],2)
=> 2 = 1 + 1
([],3)
=> 1 = 0 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,2),(1,2)],3)
=> 3 = 2 + 1
([(0,1),(0,2),(1,2)],3)
=> 4 = 3 + 1
Description
The Hosoya index of a graph.
This is the total number of matchings in the graph.
Matching statistic: St000008
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00152: Graphs —Laplacian multiplicities⟶ Integer compositions
St000008: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000008: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1] => 0
([],2)
=> [2] => 0
([(0,1)],2)
=> [1,1] => 1
([],3)
=> [3] => 0
([(1,2)],3)
=> [1,2] => 1
([(0,2),(1,2)],3)
=> [1,1,1] => 3
([(0,1),(0,2),(1,2)],3)
=> [2,1] => 2
Description
The major index of the composition.
The descents of a composition $[c_1,c_2,\dots,c_k]$ are the partial sums $c_1, c_1+c_2,\dots, c_1+\dots+c_{k-1}$, excluding the sum of all parts. The major index of a composition is the sum of its descents.
For details about the major index see [[Permutations/Descents-Major]].
Matching statistic: St000097
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([],1)
=> ([],0)
=> 0
([],2)
=> ([],0)
=> 0
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],0)
=> 0
([(1,2)],3)
=> ([],1)
=> 1
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
Description
The order of the largest clique of the graph.
A clique in a graph $G$ is a subset $U \subseteq V(G)$ such that any pair of vertices in $U$ are adjacent. I.e. the subgraph induced by $U$ is a complete graph.
Matching statistic: St000098
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([],1)
=> ([],0)
=> 0
([],2)
=> ([],0)
=> 0
([(0,1)],2)
=> ([],1)
=> 1
([],3)
=> ([],0)
=> 0
([(1,2)],3)
=> ([],1)
=> 1
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
Description
The chromatic number of a graph.
The minimal number of colors needed to color the vertices of the graph such that no two vertices which share an edge have the same color.
Matching statistic: St000147
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000147: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> []
=> 0
([],2)
=> []
=> 0
([(0,1)],2)
=> [1]
=> 1
([],3)
=> []
=> 0
([(1,2)],3)
=> [1]
=> 1
([(0,2),(1,2)],3)
=> [2]
=> 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> 3
Description
The largest part of an integer partition.
Matching statistic: St000185
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00251: Graphs —clique sizes⟶ Integer partitions
St000185: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000185: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> 0
([],2)
=> [1,1]
=> 1
([(0,1)],2)
=> [2]
=> 0
([],3)
=> [1,1,1]
=> 3
([(1,2)],3)
=> [2,1]
=> 1
([(0,2),(1,2)],3)
=> [2,2]
=> 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> 0
Description
The weighted size of a partition.
Let $\lambda = (\lambda_0\geq\lambda_1 \geq \dots\geq\lambda_m)$ be an integer partition. Then the weighted size of $\lambda$ is
$$\sum_{i=0}^m i \cdot \lambda_i.$$
This is also the sum of the leg lengths of the cells in $\lambda$, or
$$
\sum_i \binom{\lambda^{\prime}_i}{2}
$$
where $\lambda^{\prime}$ is the conjugate partition of $\lambda$.
This is the minimal number of inversions a permutation with the given shape can have, see [1, cor.2.2].
This is also the smallest possible sum of the entries of a semistandard tableau (allowing 0 as a part) of shape $\lambda=(\lambda_0,\lambda_1,\ldots,\lambda_m)$, obtained uniquely by placing $i-1$ in all the cells of the $i$th row of $\lambda$, see [2, eq.7.103].
The following 631 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000228The size of a partition. St000271The chromatic index of a graph. St000384The maximal part of the shifted composition of an integer partition. St000448The number of pairs of vertices of a graph with distance 2. St000459The hook length of the base cell of a partition. St000784The maximum of the length and the largest part of the integer partition. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. 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. St001311The cyclomatic number of a graph. St001341The number of edges in the center of a graph. St001345The Hamming dimension 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. St001621The number of atoms of a lattice. St001622The number of join-irreducible elements of a lattice. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001961The sum of the greatest common divisors of all pairs of parts. St000063The number of linear extensions of a certain poset defined for an integer partition. St000087The number of induced subgraphs. St000108The number of partitions contained in the given partition. St000300The number of independent sets of vertices of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St000532The total number of rook placements on a Ferrers board. 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. St000926The clique-coclique number of a graph. St001400The total number of Littlewood-Richardson tableaux of given shape. St001814The number of partitions interlacing the given partition. St000301The number of facets of the stable set polytope of a graph. St001664The number of non-isomorphic subposets of a poset. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000010The length of the partition. St000011The number of touch points (or returns) of a Dyck path. St000012The area of a Dyck path. St000013The height of a Dyck path. St000025The number of initial rises of a Dyck path. St000093The cardinality of a maximal independent set of vertices of a graph. St000148The number of odd parts of a partition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000160The multiplicity of the smallest part of a partition. St000169The cocharge of a standard tableau. St000171The degree of the graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000272The treewidth of a graph. St000310The minimal degree of a vertex of a graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000330The (standard) major index of a standard tableau. St000336The leg major index of a standard tableau. St000362The size of a minimal vertex cover of a graph. St000377The dinv defect of an integer partition. St000445The number of rises of length 1 of a Dyck path. St000454The largest eigenvalue of a graph if it is integral. St000475The number of parts equal to 1 in a partition. St000479The Ramsey number of a graph. St000507The number of ascents of a standard tableau. St000536The pathwidth of a graph. St000548The number of different 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. St000741The Colin de Verdière graph invariant. St000778The metric dimension of a graph. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000867The sum of the hook lengths in the first row of an integer partition. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001034The area of the parallelogram polyomino associated with the Dyck path. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001127The sum of the squares of the parts of a partition. St001161The major index north count of a Dyck path. St001176The size of a partition minus its first part. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001308The number of induced paths on three vertices in a graph. St001350Half of the Albertson index of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001391The disjunction number of a graph. St001521Half the total irregularity of a graph. St001541The Gini index of an integer partition. St001644The dimension 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. St001697The shifted natural comajor index of a standard Young tableau. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001721The degree of a binary word. 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. St001812The biclique partition number of a graph. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001949The rigidity index of a graph. St001956The comajor index for set-valued two-row standard Young tableaux. St001962The proper pathwidth of a graph. St000172The Grundy number of a graph. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000286The number of connected components of the complement of a graph. St000290The major index of a binary word. St000363The number of minimal vertex covers of a graph. St000456The monochromatic index of a connected graph. St000469The distinguishing number of a graph. St000636The hull number of a graph. St000722The number of different neighbourhoods in a graph. St000822The Hadwiger number of the graph. St001029The size of the core of a graph. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001116The game chromatic number of a graph. St001118The acyclic chromatic index of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001342The number of vertices in the center of a graph. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001389The number of partitions of the same length below the given integer partition. St001494The Alon-Tarsi number 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. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001612The number of coloured multisets of cycles such that the multiplicities of colours are given by a partition. St001645The pebbling number of a connected graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001670The connected partition number 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. St001725The harmonious chromatic number of a graph. St001746The coalition number of a graph. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001809The index of the step at the first peak of maximal height in a Dyck path. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001869The maximum cut size of a graph. St001883The mutual visibility number of a graph. St001963The tree-depth of a graph. St000378The diagonal inversion number of an integer partition. St000004The major index of a permutation. St000009The charge of a standard tableau. St000059The inversion number of a standard tableau as defined by Haglund and Stevens. St000133The "bounce" of a permutation. St000154The sum of the descent bottoms of a permutation. St000156The Denert index of a permutation. St000161The sum of the sizes of the right subtrees of a binary tree. St000224The sorting index of a permutation. St000238The number of indices that are not small weak excedances. St000289The decimal representation of a binary word. St000304The load of a permutation. St000305The inverse major index of a permutation. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000339The maf index of a permutation. St000446The disorder of a permutation. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000868The aid statistic in the sense of Shareshian-Wachs. St000947The major index east count of a Dyck path. St001287The number of primes obtained by multiplying preimage and image of a permutation and subtracting one. St001362The normalized Knill dimension of a graph. St001375The pancake length of a permutation. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001671Haglund's hag of a permutation. St001759The Rajchgot index of a permutation. St000020The rank of the permutation. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000631The number of distinct palindromic decompositions of a binary word. St000794The mak of a permutation. St000798The makl of a permutation. St000833The comajor index of a permutation. St000874The position of the last double rise in a Dyck path. St000984The number of boxes below precisely one peak. 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. 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. St001348The bounce of the parallelogram polyomino associated with the Dyck path. 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. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000420The number of Dyck paths that are weakly above a Dyck path. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001658The total number of rook placements on a Ferrers board. St001003The number of indecomposable modules with projective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001838The number of nonempty primitive factors of a binary word. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000933The number of multipartitions of sizes given by an integer partition. St000946The sum of the skew hook positions in a Dyck path. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000668The least common multiple of the parts of the partition. St001500The global dimension of magnitude 1 Nakayama algebras. St001959The product of the heights of the peaks of a Dyck path. St000259The diameter of a connected graph. St000472The sum of the ascent bottoms of a permutation. St000492The rob statistic of a set partition. St000493The los statistic of a set partition. St000498The lcs statistic of a set partition. St000499The rcb statistic of a set partition. St000577The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element. St000579The number of occurrences of the pattern {{1},{2}} such that 2 is a maximal element. St000795The mad of a permutation. St000796The stat' of a permutation. St000797The stat`` of a permutation. St001077The prefix exchange distance of a permutation. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001808The box weight or horizontal decoration of a Dyck path. St001498The normalised height of a Nakayama algebra with magnitude 1. St001570The minimal number of edges to add to make a graph Hamiltonian. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000145The Dyson rank of a partition. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000260The radius of a connected graph. St000263The Szeged index of a graph. St000265The Wiener index of a graph. St000268The number of strongly connected orientations of a graph. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000302The determinant of the distance matrix of a connected graph. St000309The number of vertices with even degree. St000460The hook length of the last cell along the main diagonal of an integer partition. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St000537The cutwidth of a graph. St000667The greatest common divisor of the parts of the partition. St000680The Grundy value for Hackendot on posets. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001073The number of nowhere zero 3-flows of a graph. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001279The sum of the parts of an integer partition that are at least two. St001281The normalized isoperimetric number of a graph. St001360The number of covering relations in Young's lattice below a partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001458The rank of the adjacency matrix of a graph. St001459The number of zero columns in the nullspace of a graph. St001478The number of nowhere zero 4-flows of a graph. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001743The discrepancy of a graph. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001792The arboricity of a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001827The number of two-component spanning forests of a graph. St000015The number of peaks of a Dyck path. St000016The number of attacking pairs of a standard tableau. St000026The position of the first return of a Dyck path. St000048The multinomial of the parts of a partition. St000053The number of valleys of the Dyck path. St000088The row sums of the character table of the symmetric group. St000120The number of left tunnels of a Dyck path. St000144The pyramid weight of the Dyck path. St000179The product of the hook lengths of the 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. St000293The number of inversions of a binary word. St000306The bounce count of a Dyck path. St000315The number of isolated vertices of a graph. St000321The number of integer partitions of n that are dominated by an integer partition. St000331The number of upper interactions of a Dyck path. St000335The difference of lower and upper interactions. St000340The number of non-final maximal constant sub-paths of length greater than one. St000345The number of refinements of a partition. St000379The number of Hamiltonian cycles in a graph. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000395The sum of the heights of the peaks of a Dyck path. St000442The maximal area to the right of an up step of a Dyck path. St000443The number of long tunnels of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000478Another weight of a partition according to Alladi. St000482The (zero)-forcing number of a graph. St000509The diagonal index (content) of a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000519The largest length of a factor maximising the subword complexity. St000531The leading coefficient of the rook polynomial of an integer partition. St000544The cop number of a graph. St000549The number of odd partial sums of an integer partition. St000553The number of blocks of a graph. St000567The sum of the products of all pairs of parts. St000644The number of graphs with given frequency partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000734The last entry in the first row of a standard tableau. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. 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. 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. St000812The sum of the entries in the column specified by the partition of the change of basis matrix from complete homogeneous symmetric functions to monomial symmetric functions. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000850The number of 1/2-balanced pairs in a poset. St000877The depth of the binary word interpreted as a path. St000885The number of critical steps in the Catalan decomposition of a binary word. St000899The maximal number of repetitions of an integer composition. St000900The minimal number of repetitions of a part in an integer composition. St000902 The minimal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St000910The number of maximal chains of minimal length in a poset. St000916The packing number of a graph. St000917The open packing number of a graph. St000918The 2-limited packing number of a graph. St000921The number of internal inversions of a binary word. St000922The minimal number such that all substrings of this length are unique. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000935The number of ordered refinements of an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000951The dimension of $Ext^{1}(D(A),A)$ of the corresponding LNakayama algebra. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000976The sum of the positions of double up-steps of a Dyck path. St000982The length of the longest constant subword. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001008Number of indecomposable injective modules with projective dimension 1 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. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant 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. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension 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. St001024Maximum of dominant dimensions of the simple modules 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. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. 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. 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. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. 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. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. 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:
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. 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. 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. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001286The annihilation number of a graph. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. 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. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001312Number of parabolic noncrossing partitions indexed by the composition. 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. 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. St001340The cardinality of a minimal non-edge isolating set of a graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. 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. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001441The number of non-empty connected induced subgraphs of a graph. St001462The number of factors of a standard tableaux under concatenation. St001463The number of distinct columns in the nullspace of a graph. St001480The number of simple summands of the module J^2/J^3. St001484The number of singletons of an integer partition. St001486The number of corners of the ribbon associated with an integer composition. 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. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001523The degree of symmetry of a Dyck path. St001530The depth of a Dyck path. St001561The value of the elementary symmetric function evaluated at 1. St001592The maximal number of simple paths between any two different vertices of a graph. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001614The cyclic permutation representation number of a skew partition. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001637The number of (upper) dissectors of a poset. St001651The Frankl number of a lattice. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001672The restrained domination number of a graph. St001675The number of parts equal to the part in the reversed composition. St001688The sum of the squares of the heights of the peaks of a Dyck path. St001691The number of kings in a graph. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001733The number of weak left to right maxima of a Dyck path. St001757The number of orbits of toric promotion on a graph. St001777The number of weak descents in an integer composition. St001828The Euler characteristic of a graph. St001829The common independence number of a graph. St001845The number of join irreducibles minus the rank of a lattice. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001931The weak major index of an integer composition regarded as a word. St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition. St001933The largest multiplicity of a part in an integer partition. St001955The number of natural descents for set-valued two row standard Young tableaux. St001613The binary logarithm of the size of the center of a lattice. St001617The dimension of the space of valuations of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St000422The energy of a graph, if it is integral. St000014The number of parking functions supported by a Dyck path. St000117The number of centered tunnels of a Dyck path. St000288The number of ones in a binary word. St000296The length of the symmetric border of a binary word. St000297The number of leading ones in a binary word. St000326The position of the first one in a binary word after appending a 1 at the end. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000348The non-inversion sum of a binary word. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000383The last part of an integer composition. St000391The sum of the positions of the ones in a binary word. St000392The length of the longest run of ones in a binary word. St000393The number of strictly increasing runs in a binary word. St000655The length of the minimal rise of a Dyck path. St000657The smallest part of an integer composition. St000674The number of hills of a Dyck path. St000678The number of up steps after the last double rise 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. St000691The number of changes of a binary word. St000733The row containing the largest entry of a standard tableau. St000738The first entry in the last row of a standard tableau. St000753The Grundy value for the game of Kayles on a binary word. St000792The Grundy value for the game of ruler on a binary word. St000808The number of up steps of the associated bargraph. St000869The sum of the hook lengths of an integer partition. St000876The number of factors in the Catalan decomposition of a binary word. St000878The number of ones minus the number of zeros of a binary word. St000932The number of occurrences of the pattern UDU in a Dyck path. St000939The number of characters of the symmetric group whose value on the partition is positive. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000983The length of the longest alternating subword. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of 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. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension 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. 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. St001027Number of simple modules with projective dimension equal to injective 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. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001102The number of words with multiplicities of the letters given by the composition, avoiding the consecutive pattern 132. St001172The number of 1-rises at odd height of a Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of 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. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension 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. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001274The number of indecomposable injective modules with projective dimension equal to two. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001313The number of Dyck paths above the lattice path given by a binary word. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001372The length of a longest cyclic run of ones of a binary word. St001415The length of the longest palindromic prefix of a binary word. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001481The minimal height of a peak of a Dyck path. St001485The modular major index of a binary word. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001584The area statistic between a Dyck path and its bounce path. St001669The number of single rises in a Dyck path. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001910The height of the middle non-run of a Dyck path. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St001930The weak major index of a binary word. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000137The Grundy value of an integer partition. St000455The second largest eigenvalue of a graph if it is integral. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000699The toughness times the least common multiple of 1,. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St001378The product of the cohook lengths of the integer partition. St001383The BG-rank of an integer partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001525The number of symmetric hooks on the diagonal of a partition. St001564The value of the forgotten symmetric functions when all variables set to 1. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001626The number of maximal proper sublattices of a lattice. St000038The product of the heights of the descending steps of a Dyck path. St000142The number of even parts of a partition. St000143The largest repeated part of a partition. St000150The floored half-sum of the multiplicities of a partition. St000159The number of distinct parts of the integer partition. St000183The side length of the Durfee square of an integer partition. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000256The number of parts from which one can substract 2 and still get an integer partition. St000257The number of distinct parts of a partition that occur at least twice. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000295The length of the border of a binary word. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000346The number of coarsenings of a partition. St000347The inversion sum of a binary word. St000389The number of runs of ones of odd length in a binary word. St000418The number of Dyck paths that are weakly below a Dyck path. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000511The number of invariant subsets when acting with a permutation of given cycle type. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000547The number of even non-empty partial sums of an integer partition. St000627The exponent of a binary word. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000705The number of semistandard tableaux on a given integer partition of n with maximal entry n. St000715The number of semistandard Young tableaux of given shape and entries at most 3. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000759The smallest missing part in an integer partition. St000762The sum of the positions of the weak records of an integer composition. St000783The side length of the largest staircase partition fitting into a partition. St000815The number of semistandard Young tableaux of partition weight of given shape. St000897The number of different multiplicities of parts of an integer partition. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000995The largest even part of an integer partition. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001091The number of parts in an integer partition whose next smaller part has the same size. St001092The number of distinct even parts of a partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001139The number of occurrences of hills of size 2 in a Dyck path. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001242The toal dimension of certain Sn modules determined by LLT polynomials associated with a Dyck path. St001243The sum of coefficients in the Schur basis of certain LLT polynomials associated with a Dyck path. St001248Sum of the even parts of a partition. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001252Half the sum of the even parts of a partition. St001267The length of the Lyndon factorization of the binary word. St001280The number of parts of an integer partition that are at least two. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001413Half the length of the longest even length palindromic prefix of a binary word. St001424The number of distinct squares in a binary word. St001437The flex of a binary word. St001488The number of corners of a skew partition. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001524The degree of symmetry of a binary word. St001531Number of partial orders contained in the poset determined by the Dyck path. St001587Half of the largest even part of an integer partition. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001610The number of coloured endofunctions such that the multiplicities of colours are given by a partition. St001657The number of twos in an integer partition. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001732The number of peaks visible from the left. St001884The number of borders of a binary word. St001915The size of the component corresponding to a necklace in Bulgarian solitaire. St001916The number of transient elements in the orbit of Bulgarian solitaire corresponding to a necklace.
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!