searching the database
Your data matches 524 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: St000093
(load all 13 compositions to match this statistic)
(load all 13 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 2
([(0,1)],2)
=> 1
([],3)
=> 3
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 1
([],4)
=> 4
([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
Description
The cardinality of a maximal independent set of vertices of a graph.
An independent set of a graph is a set of pairwise non-adjacent vertices. A maximum independent set is an independent set of maximum cardinality. This statistic is also called the independence number or stability number $\alpha(G)$ of $G$.
Matching statistic: St000097
(load all 17 compositions to match this statistic)
(load all 17 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)
=> 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 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 17 compositions to match this statistic)
(load all 17 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)
=> 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 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: St000482
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 2
([(0,1)],2)
=> 1
([],3)
=> 3
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> 2
([],4)
=> 4
([(2,3)],4)
=> 3
([(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)
=> 1
([(1,2),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
Description
The (zero)-forcing number of a graph.
This is the minimal number of vertices initially coloured black, such that eventually all vertices of the graph are coloured black when using the following rule:
when $u$ is a black vertex of $G$, and exactly one neighbour $v$ of $u$ is white, then colour $v$ black.
Matching statistic: St000786
(load all 13 compositions to match this statistic)
(load all 13 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 2
([(0,1)],2)
=> 1
([],3)
=> 3
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 1
([],4)
=> 4
([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
Description
The maximal number of occurrences of a colour in a proper colouring of a graph.
To any proper colouring with the minimal number of colours possible we associate the integer partition recording how often each colour is used. This statistic records the largest part occurring in any of these partitions.
For example, the graph on six vertices consisting of a square together with two attached triangles - ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(3,5),(4,5)],6) in the list of values - is three-colourable and admits two colouring schemes, $[2,2,2]$ and $[3,2,1]$. Therefore, the statistic on this graph is $3$.
Matching statistic: St001029
(load all 17 compositions to match this statistic)
(load all 17 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)
=> 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 size of the core of a graph.
The core of the graph $G$ is the smallest graph $C$ such that there is a graph homomorphism from $G$ to $C$ and a graph homomorphism from $C$ to $G$.
Matching statistic: St001337
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 2
([(0,1)],2)
=> 1
([],3)
=> 3
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 1
([],4)
=> 4
([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
Description
The upper domination number of a graph.
This is the maximum cardinality of a minimal dominating set of $G$.
The smallest graph with different upper irredundance number and upper domination number has eight vertices. It is obtained from the disjoint union of two copies of $K_4$ by joining three of the four vertices of the first with three of the four vertices of the second. For bipartite graphs the two parameters always coincide [1].
Matching statistic: St001338
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Values
([],1)
=> 1
([],2)
=> 2
([(0,1)],2)
=> 1
([],3)
=> 3
([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> 1
([],4)
=> 4
([(2,3)],4)
=> 3
([(1,3),(2,3)],4)
=> 3
([(0,3),(1,3),(2,3)],4)
=> 3
([(0,3),(1,2)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
Description
The upper irredundance number of a graph.
A set $S$ of vertices is irredundant, if there is no vertex in $S$, whose closed neighbourhood is contained in the union of the closed neighbourhoods of the other vertices of $S$.
The upper irredundance number is the largest size of a maximal irredundant set.
The smallest graph with different upper irredundance number and upper domination number [[St001337]] has eight vertices. It is obtained from the disjoint union of two copies of $K_4$ by joining three of the four vertices of the first with three of the four vertices of the second. For bipartite graphs the two parameters always coincide [2].
Matching statistic: St001494
(load all 17 compositions to match this statistic)
(load all 17 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)
=> 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 Alon-Tarsi number of a graph.
Let $G$ be a graph with vertices $\{1,\dots,n\}$ and edge set $E$. Let $P_G=\prod_{i < j, (i,j)\in E} x_i-x_j$ be its graph polynomial. Then the Alon-Tarsi number is the smallest number $k$ such that $P_G$ contains a monomial with exponents strictly less than $k$.
Matching statistic: St000087
(load all 4 compositions to match this statistic)
(load all 4 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)
=> ([(0,1)],2)
=> 2
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([],4)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(0,1)],2)
=> 2
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(0,3),(1,2)],4)
=> ([(0,1)],2)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 2
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 3
([(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)
=> 3
([(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)
=> 4
Description
The number of induced subgraphs.
A subgraph $H \subseteq G$ is induced if $E(H)$ consists of all edges in $E(G)$ that connect the vertices of $H$.
The following 514 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000147The largest part of an integer partition. St000172The Grundy number of a graph. St000286The number of connected components of the complement of a graph. St000363The number of minimal vertex covers of a graph. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000452The number of distinct eigenvalues of a graph. St000469The distinguishing number of a graph. St000636The hull number of a graph. St000722The number of different neighbourhoods in a graph. St000778The metric dimension of a graph. St000808The number of up steps of the associated bargraph. St000822The Hadwiger number of the graph. St000926The clique-coclique number of a graph. St001093The detour number of a graph. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001116The game chromatic number of a graph. St001235The global dimension of the corresponding Comp-Nakayama algebra. 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. St001358The largest degree of a regular subgraph of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. 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. St001674The number of vertices of the largest induced star graph in the 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. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001883The mutual visibility number of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001963The tree-depth of a graph. St000171The degree of the graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000272The treewidth of a graph. St000300The number of independent sets of vertices of a graph. St000301The number of facets of the stable set polytope of a graph. St000310The minimal degree of a vertex of a graph. St000362The size of a minimal vertex cover of a graph. St000454The largest eigenvalue of a graph if it is integral. St000536The pathwidth of a graph. St000741The Colin de Verdière graph invariant. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001323The independence gap of a graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001357The maximal degree of a regular spanning subgraph of a graph. St001391The disjunction number of a graph. St001644The dimension of a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001777The number of weak descents in an integer composition. St001812The biclique partition number of a graph. St001949The rigidity index of a graph. St001962The proper pathwidth of a graph. St000010The length of the partition. St000011The number of touch points (or returns) of a Dyck path. St000013The height of a Dyck path. St000015The number of peaks of a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000068The number of minimal elements in a poset. St000069The number of maximal elements of a poset. St000071The number of maximal chains in a poset. St000181The number of connected components of the Hasse diagram for the poset. St000184The size of the centralizer of any permutation of given cycle type. St000189The number of elements in the poset. St000228The size of a partition. St000258The burning number of a graph. St000273The domination number of a graph. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000287The number of connected components of a graph. St000288The number of ones in a binary word. St000309The number of vertices with even degree. St000315The number of isolated vertices of a graph. St000335The difference of lower and upper interactions. St000378The diagonal inversion number of an integer partition. St000383The last part of an integer composition. St000384The maximal part of the shifted composition of an integer partition. St000388The number of orbits of vertices of a graph under automorphisms. 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. St000479The Ramsey number of a graph. St000527The width of the poset. St000531The leading coefficient of the rook polynomial of an integer partition. St000544The cop number of a graph. St000553The number of blocks of a graph. St000667The greatest common divisor of the parts of the partition. St000676The number of odd rises of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. 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. 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. 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. St000784The maximum of the length and the largest part of the integer partition. St000820The number of compositions obtained by rotating the composition. 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. 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. St000908The length of the shortest maximal antichain in a poset. St000909The number of maximal chains of maximal size in a poset. St000916The packing number of a graph. St000917The open packing number of a graph. St000918The 2-limited packing number of a graph. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. 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. 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. St001102The number of words with multiplicities of the letters given by the composition, avoiding the consecutive pattern 132. 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:
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. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001268The size of the largest ordinal summand in the poset. St001286The annihilation number of a graph. 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. St001339The irredundance number of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001360The number of covering relations in Young's lattice below a partition. 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. St001389The number of partitions of the same length below the given integer partition. St001399The distinguishing number of a poset. St001441The number of non-empty connected induced subgraphs of a graph. St001463The number of distinct columns in the nullspace of a graph. St001527The cyclic permutation representation number of an integer partition. St001530The depth of a Dyck path. St001571The Cartan determinant of the integer partition. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001672The restrained domination number of a graph. St001675The number of parts equal to the part in the reversed composition. St001691The number of kings in a graph. St001779The order of promotion on the set of linear extensions of a poset. St001809The index of the step at the first peak of maximal height in a Dyck path. St001828The Euler characteristic of a graph. St001829The common independence number of a graph. St000008The major index of the composition. St000053The number of valleys of the Dyck path. St000063The number of linear extensions of a certain poset defined for an integer partition. St000089The absolute variation of a composition. St000108The number of partitions contained in the given partition. St000145The Dyson rank of a partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000180The number of chains of a poset. St000295The length of the border of a binary word. St000306The bounce count of a Dyck path. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000439The position of the first down step of a Dyck path. St000474Dyson's crank of a partition. St000532The total number of rook placements on a Ferrers board. St000632The jump number of the poset. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000766The number of inversions of an integer composition. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. 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. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. 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. 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. St001331The size of the minimal feedback vertex set. St001340The cardinality of a minimal non-edge isolating set of a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001400The total number of Littlewood-Richardson tableaux of given shape. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001458The rank of the adjacency matrix of a graph. St001459The number of zero columns in the nullspace of a graph. 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. St001578The minimal number of edges to add or remove to make a graph a line graph. St001638The book thickness of a graph. St001642The Prague 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. St001664The number of non-isomorphic subposets of a poset. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001742The difference of the maximal and the minimal degree in a graph. St001814The number of partitions interlacing the given partition. St001834The number of non-isomorphic minors of a graph. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001706The number of closed sets in a graph. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000014The number of parking functions supported by a Dyck path. St000047The number of standard immaculate tableaux of a given shape. St000048The multinomial of the parts of a partition. St000054The first entry of the permutation. St000081The number of edges of a graph. St000086The number of subgraphs. 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. St000213The number of weak exceedances (also weak excedences) of a permutation. St000271The chromatic index of a graph. St000277The number of ribbon shaped standard tableaux. St000293The number of inversions of a binary word. St000296The length of the symmetric border of a binary word. St000297The number of leading ones in a binary word. St000299The number of nonisomorphic vertex-induced subtrees. St000314The number of left-to-right-maxima of a permutation. St000392The length of the longest run of ones in a binary word. St000393The number of strictly increasing runs in a binary word. 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. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. 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. St000468The Hosoya index of a graph. 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. St000507The number of ascents of a standard tableau. St000519The largest length of a factor maximising the subword complexity. St000548The number of different non-empty partial sums of an integer partition. St000617The number of global maxima of a Dyck path. St000627The exponent of a binary word. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000657The smallest part of an integer composition. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000733The row containing the largest entry of a standard tableau. St000738The first entry in the last row of a standard tableau. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000867The sum of the hook lengths in the first row 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. St000885The number of critical steps in the Catalan decomposition of a binary word. St000922The minimal number such that all substrings of this length are unique. St000947The major index east count of a Dyck path. St000982The length of the longest constant subword. St000991The number of right-to-left minima of a permutation. St001007Number of simple modules with projective dimension 1 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. 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. St001034The area of the parallelogram polyomino associated with the Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001117The game chromatic index of a graph. St001118The acyclic chromatic index of a graph. St001127The sum of the squares of the parts of a partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001161The major index north count of a Dyck path. 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. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001224Let 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. 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. St001239The largest vector space dimension of the double dual of a simple module 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. 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. 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. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001267The length of the Lyndon factorization of the binary word. 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. St001345The Hamming dimension of a graph. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001372The length of a longest cyclic run of ones of a binary word. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. 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. St001437The flex of a binary word. St001462The number of factors of a standard tableaux under concatenation. St001479The number of bridges of a graph. St001480The number of simple summands of the module J^2/J^3. St001486The number of corners of the ribbon associated with an integer composition. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001497The position of the largest weak excedence of a permutation. St001498The normalised height of a Nakayama algebra with magnitude 1. 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. St001614The cyclic permutation representation number of a skew partition. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001688The sum of the squares of the heights of the peaks of a Dyck path. St001733The number of weak left to right maxima of a Dyck path. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001826The maximal number of leaves on a vertex of a graph. St001827The number of two-component spanning forests of a graph. St001869The maximum cut size of a graph. St001884The number of borders of a binary word. St001917The order of toric promotion on the set of labellings of a graph. St001933The largest multiplicity of a part in an integer partition. St001959The product of the heights of the peaks of a Dyck path. St000024The number of double up and double down steps of a Dyck path. St000090The variation of a composition. St000091The descent variation of a composition. St000157The number of descents of a standard tableau. St000294The number of distinct factors of a binary word. 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. St000374The number of exclusive right-to-left minima of a permutation. St000377The dinv defect of an integer partition. St000420The number of Dyck paths that are weakly above a Dyck path. St000442The maximal area to the right of an up 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. St000543The size of the conjugacy class of a binary word. St000549The number of odd partial sums of an integer partition. St000626The minimal period of a binary word. St000682The Grundy value of Welter's game on a binary word. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. St000873The aix statistic of a permutation. St000874The position of the last double rise in a Dyck path. St000877The depth of the binary word interpreted as a path. St000915The Ore degree of a graph. St000921The number of internal inversions of a binary word. St000949Gives the number of generalised tilting modules of the corresponding LNakayama algebra. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000968We 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}$. 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}$. St000996The number of exclusive left-to-right maxima of a permutation. 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. 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. St001012Number of simple modules with projective dimension at most 2 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. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001065Number of indecomposable 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. St001126Number of simple module that are 1-regular 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. 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. 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. St001185The number of indecomposable injective modules of grade at least 2 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. St001190Number of simple modules with projective dimension at most 4 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$. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module 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. 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. 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 St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. 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. 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. 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. 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. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001808The box weight or horizontal decoration of a Dyck path. St001955The number of natural descents for set-valued two row standard Young tableaux. St000806The semiperimeter of the associated bargraph. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. 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. 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. St001838The number of nonempty primitive factors of a binary word. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. St000826The stopping time of the decimal representation of the binary word for the 3x+1 problem. St000668The least common multiple of the parts of the partition. St000678The number of up steps after the last double rise of a Dyck path. St000702The number of weak deficiencies of a permutation. St000708The product of the parts of an integer partition. St000932The number of occurrences of the pattern UDU in a Dyck path. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001621The number of atoms of a lattice. St000477The weight of a partition according to Alladi. St000639The number of relations in a poset. St000641The number of non-empty boolean intervals in a poset. St000644The number of graphs with given frequency partition. St000770The major index of an integer partition when read from bottom to top. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000910The number of maximal chains of minimal length in a poset. St000914The sum of the values of the Möbius function of a poset. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000674The number of hills of a Dyck path. St000815The number of semistandard Young tableaux of partition weight of given shape. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000993The multiplicity of the largest part of an integer partition. 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. St001060The distinguishing index of a graph. St001471The magnitude of a Dyck path. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. 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. St001165Number of simple modules with even projective dimension 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. St001274The number of indecomposable injective modules with projective dimension equal to two. St000455The second largest eigenvalue of a graph if it is integral. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000939The number of characters of the symmetric group whose value on the partition is positive. St000675The number of centered multitunnels of a Dyck path. St001624The breadth of a lattice. 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$. St000735The last entry on the main diagonal of a standard tableau. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000478Another weight of a partition according to Alladi. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. 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$. St000466The Gutman (or modified Schultz) index of a connected graph. St001668The number of points of the poset minus the width of the poset. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000630The length of the shortest palindromic decomposition of a binary word. St000759The smallest missing part in an integer partition. 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. 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. St001500The global dimension of magnitude 1 Nakayama algebras. 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. St000464The Schultz index of a connected graph. St001545The second Elser number of a connected graph. St001281The normalized isoperimetric number of a graph. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St001568The smallest positive integer that does not appear twice in the partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. 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. St000264The girth of a graph, which is not a tree. St000937The number of positive values of the symmetric group character corresponding to the 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. St000707The product of the factorials of the parts. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000933The number of multipartitions of sizes given by an integer partition. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001531Number of partial orders contained in the poset determined by the Dyck path. St001626The number of maximal proper sublattices of a lattice. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the 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.
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!