The minimal length of a chain of small intervals in a lattice. An interval $[a, b]$ is small if $b$ is a join of elements covering $a$.

The sum of the values of the Möbius function of a poset. The Möbius function $\mu$ of a finite poset is defined as $$\mu (x,y)=\begin{cases} 1& \text{if }x = y\\ -\sum _{z: x\leq z < y}\mu (x,z)& \text{for }x < y\\ 0&\text{otherwise}. \end{cases} $$ Since $\mu(x,y)=0$ whenever $x\not\leq y$, this statistic is $$ \sum_{x\leq y} \mu(x,y). $$ If the poset has a minimal or a maximal element, then the definition implies immediately that the statistic equals $1$. Moreover, the statistic equals the sum of the statistics of the connected components. This statistic is also called the magnitude of a poset.

The Frankl number of a lattice. For a lattice $L$ on at least two elements, this is $$ \max_x(|L|-2|[x, 1]|), $$ where we maximize over all join irreducible elements and $[x, 1]$ denotes the interval from $x$ to the top element. Frankl's conjecture asserts that this number is non-negative, and zero if and only if $L$ is a Boolean lattice.

The maximum magnitude of the Möbius function of a poset. The '''Möbius function''' of a poset is the multiplicative inverse of the zeta function in the incidence algebra. The Möbius value $\mu(x, y)$ is equal to the signed sum of chains from $x$ to $y$, where odd-length chains are counted with a minus sign, so this statistic is bounded above by the total number of chains in the poset.