The number of posets with combinatorially isomorphic order polytopes.

The Grundy value for Hackendot on posets. Two players take turns and remove an order filter. The player who is faced with the one element poset looses. This game is a slight variation of Chomp. This statistic is the Grundy value of the poset, that is, the smallest non-negative integer which does not occur as value of a poset obtained by a single move.

The dimension of the reduced incidence algebra of a poset. The reduced incidence algebra of a poset is the subalgebra of the incidence algebra consisting of the elements which assign the same value to any two intervals that are isomorphic to each other as posets. Thus, this statistic returns the number of non-isomorphic intervals of the poset.

The largest size of an interval in a poset.

The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset.

The annihilation number of a graph. For a graph on $m$ edges with degree sequence $d_1\leq\dots\leq d_n$, this is the largest number $k\leq n$ such that $\sum_{i=1}^k d_i \leq m$.

The number of distinct columns in the nullspace of a graph. Let $A$ be the adjacency matrix of a graph on $n$ vertices, and $K$ a $n\times d$ matrix whose column vectors form a basis of the nullspace of $A$. Then any other matrix $K'$ whose column vectors also form a basis of the nullspace is related to $K$ by $K' = K T$ for some invertible $d\times d$ matrix $T$. Any two rows of $K$ are equal if and only if they are equal in $K'$. The nullspace of a graph is usually written as a $d\times n$ matrix, hence the name of this statistic.

The number of maximal proper sublattices of a lattice.

The number of simple modules with projective dimension at most 1.

The hook length of the base cell of a partition. This is also known as the perimeter of a partition. In particular, the perimeter of the empty partition is zero.