searching the database
Your data matches 245 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: St000172
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 1
([(0,1)],2)
=> 2
([],3)
=> 1
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 3
([],4)
=> 1
([(2,3)],4)
=> 2
([(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> 3
([(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
Description
The Grundy number of a graph.
The Grundy number $\Gamma(G)$ is defined to be the largest $k$ such that $G$ admits a greedy $k$-coloring. Any order of the vertices of $G$ induces a greedy coloring by assigning to the $i$-th vertex in this order the smallest positive integer such that the partial coloring remains a proper coloring.
In particular, we have that $\chi(G) \leq \Gamma(G) \leq \Delta(G) + 1$, where $\chi(G)$ is the chromatic number of $G$ ([[St000098]]), and where $\Delta(G)$ is the maximal degree of a vertex of $G$ ([[St000171]]).
Matching statistic: St000822
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 1
([(0,1)],2)
=> 2
([],3)
=> 1
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 3
([],4)
=> 1
([(2,3)],4)
=> 2
([(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> 3
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
Description
The Hadwiger number of the graph.
Also known as clique contraction number, this is the size of the largest complete minor.
Matching statistic: St001580
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 1
([(0,1)],2)
=> 2
([],3)
=> 1
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 3
([],4)
=> 1
([(2,3)],4)
=> 2
([(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> 3
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
Description
The acyclic chromatic number of a graph.
This is the smallest size of a vertex partition $\{V_1,\dots,V_k\}$ such that each $V_i$ is an independent set and for all $i,j$ the subgraph inducted by $V_i\cup V_j$ does not contain a cycle.
Matching statistic: St001581
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 1
([(0,1)],2)
=> 2
([],3)
=> 1
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 3
([],4)
=> 1
([(2,3)],4)
=> 2
([(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> 3
([(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
Description
The achromatic number of a graph.
This is the maximal number of colours of a proper colouring, such that for any pair of colours there are two adjacent vertices with these colours.
Matching statistic: St000272
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Values
([],1)
=> 0 = 1 - 1
([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> 1 = 2 - 1
([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> 1 = 2 - 1
([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> 1 = 2 - 1
([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,3),(1,2)],4)
=> 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
=> 1 = 2 - 1
([(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 3 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
Description
The treewidth of a graph.
A graph has treewidth zero if and only if it has no edges. A connected graph has treewidth at most one if and only if it is a tree. A connected graph has treewidth at most two if and only if it is a series-parallel graph.
Matching statistic: St000536
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Values
([],1)
=> 0 = 1 - 1
([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> 1 = 2 - 1
([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> 1 = 2 - 1
([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> 1 = 2 - 1
([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,3),(1,2)],4)
=> 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
=> 1 = 2 - 1
([(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 3 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
Description
The pathwidth of a graph.
Matching statistic: St001277
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Values
([],1)
=> 0 = 1 - 1
([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> 1 = 2 - 1
([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> 1 = 2 - 1
([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> 1 = 2 - 1
([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,3),(1,2)],4)
=> 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
=> 1 = 2 - 1
([(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 3 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
Description
The degeneracy of a graph.
The degeneracy of a graph $G$ is the maximum of the minimum degrees of the (vertex induced) subgraphs of $G$.
Matching statistic: St001358
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([],1)
=> 0 = 1 - 1
([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> 1 = 2 - 1
([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> 1 = 2 - 1
([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> 1 = 2 - 1
([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,3),(1,2)],4)
=> 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
=> 1 = 2 - 1
([(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 3 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
Description
The largest degree of a regular subgraph of a graph.
For $k > 2$, it is an NP-complete problem to determine whether a graph has a $k$-regular subgraph, see [1].
Matching statistic: St000388
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> 1
([],2)
=> ([(0,2),(1,2)],3)
=> 2
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 2
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The number of orbits of vertices of a graph under automorphisms.
Matching statistic: St000918
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],1)
=> 1
([(0,1)],2)
=> ([(0,1)],2)
=> 2
([],3)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(1,2)],3)
=> 3
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([],4)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(1,2)],3)
=> 3
([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 3
([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 4
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 3
([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
Description
The 2-limited packing number of a graph.
A subset $B$ of the set of vertices of a graph is a $k$-limited packing set if its intersection with the (closed) neighbourhood of any vertex is at most $k$. The $k$-limited packing number is the largest number of vertices in a $k$-limited packing set.
The following 235 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001108The 2-dynamic chromatic number of a graph. St001116The game chromatic 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. St001670The connected partition number of a graph. St001963The tree-depth of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000778The metric dimension of a graph. St001331The size of the minimal feedback vertex set. St001512The minimum rank of a graph. St001746The coalition number of a graph. St000452The number of distinct eigenvalues of a graph. St000482The (zero)-forcing number of a graph. St000784The maximum of the length and the largest part of the integer partition. St001119The length of a shortest maximal path in a graph. St001315The dissociation number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001391The disjunction number of a graph. St000636The hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St000015The number of peaks of a Dyck path. St000384The maximal part of the shifted composition of an integer partition. St000451The length of the longest pattern of the form k 1 2. St000453The number of distinct Laplacian eigenvalues of a graph. St000676The number of odd rises of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001135The projective dimension of the first simple module in the Nakayama 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. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001530The depth of a Dyck path. St001674The number of vertices of the largest induced star graph in the graph. St001733The number of weak left to right maxima of a Dyck path. St000028The number of stack-sorts needed to sort a permutation. St000053The number of valleys of the Dyck path. St000120The number of left tunnels of a Dyck path. St000141The maximum drop size of a permutation. St000160The multiplicity of the smallest part of a partition. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000769The major index of a composition regarded as a word. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001215Let X be the direct sum of all simple modules 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. St001274The number of indecomposable injective modules with projective dimension equal to two. 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. St001486The number of corners of the ribbon associated with an integer composition. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001812The biclique partition number of a graph. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St001644The dimension of a graph. St000741The Colin de Verdière graph invariant. St001621The number of atoms of a lattice. St000776The maximal multiplicity of an eigenvalue in a graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected 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. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000259The diameter of a connected graph. St000686The finitistic dominant dimension of a Dyck path. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. 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:
St001372The length of a longest cyclic run of ones of a binary word. St001471The magnitude of a Dyck path. St001500The global dimension of magnitude 1 Nakayama algebras. St000260The radius of a connected graph. St000469The distinguishing number of a graph. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000144The pyramid weight of the Dyck path. St000335The difference of lower and upper interactions. St000443The number of long tunnels of a Dyck path. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in 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. St001165Number of simple modules with even projective dimension 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. St001200The number of simple modules in $eAe$ with projective dimension at most 2 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. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. 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. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. 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. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. 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. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000455The second largest eigenvalue of a graph if it is integral. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000910The number of maximal chains of minimal length in a poset. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St000939The number of characters of the symmetric group whose value on the partition is positive. St001060The distinguishing index of a graph. St001624The breadth of a lattice. St001645The pebbling number of a connected graph. St000675The number of centered multitunnels of a Dyck path. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St000735The last entry on the main diagonal of a standard tableau. St000478Another weight of a partition according to Alladi. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St000466The Gutman (or modified Schultz) index of a connected graph. St001118The acyclic chromatic index of a graph. St001668The number of points of the poset minus the width of the poset. St000014The number of parking functions supported by 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. St000294The number of distinct factors of a binary word. St000318The number of addable cells of the Ferrers diagram 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. St000420The number of Dyck paths that are weakly above a Dyck path. St000439The position of the first down step of a Dyck path. St000518The number of distinct subsequences in a binary word. St000529The number of permutations whose descent word is the given binary word. St000532The total number of rook placements on a Ferrers board. St000543The size of the conjugacy class of a binary word. St000626The minimal period of a binary word. St000630The length of the shortest palindromic decomposition of a binary word. St000759The smallest missing part in an integer partition. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000953The largest degree of an irreducible factor of the Coxeter polynomial of the Dyck path over the rational numbers. St000983The length of the longest alternating subword. 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. 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. St001023Number of simple modules with projective dimension at most 3 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. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. 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 St001267The length of the Lyndon factorization of the binary word. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001299The product of all non-zero projective dimensions of simple modules of the corresponding Nakayama algebra. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001400The total number of Littlewood-Richardson tableaux of given shape. St001437The flex of a binary word. 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. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St001658The total number of rook placements on a Ferrers board. St001814The number of partitions interlacing the given partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000264The girth of a graph, which is not a tree. St001281The normalized isoperimetric number of a graph. St001568The smallest positive integer that does not appear twice in the partition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St000464The Schultz index of a connected graph. St001545The second Elser number of a connected graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St001651The Frankl number of a lattice. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St000422The energy of a graph, if it is integral. St000937The number of positive values of the symmetric group character corresponding to the partition. St000993The multiplicity of the largest part of an integer partition. St001613The binary logarithm of the size of the center of a lattice. St001617The dimension of the space of valuations of a lattice. St001875The number of simple modules with projective dimension at most 1. St001881The number of factors of a lattice as a Cartesian product of lattices. St000302The determinant of the distance matrix of a connected graph. St000467The hyper-Wiener index of a connected graph. St001845The number of join irreducibles minus the rank of a lattice. St000418The number of Dyck paths that are weakly below a Dyck path. St000438The position of the last up step in a Dyck path. St000444The length of the maximal rise of a Dyck path. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000668The least common multiple of the parts of the partition. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. 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. St000815The number of semistandard Young tableaux of partition weight of given shape. St000933The number of multipartitions of sizes given by an integer partition. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001531Number of partial orders contained in the poset determined by the Dyck path. St001808The box weight or horizontal decoration of a Dyck path. St001959The product of the heights of the peaks of a Dyck path. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001626The number of maximal proper sublattices of a lattice. St000460The hook length of the last cell along the main diagonal of an integer partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St001360The number of covering relations in Young's lattice below a partition. St001378The product of the cohook lengths of the integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St001561The value of the elementary symmetric function evaluated at 1. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. 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. St001610The number of coloured endofunctions such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001933The largest multiplicity of a part in an integer partition.
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!