The size of the Grassmannian interval associated with a decorated permutation.

The breadth of a lattice. The '''breadth''' of a lattice is the least integer $b$ such that any join $x_1\vee x_2\vee\cdots\vee x_n$, with $n > b$, can be expressed as a join over a proper subset of $\{x_1,x_2,\ldots,x_n\}$.

The number of distinct eigenvalues of the distance Laplacian of a connected graph.

The smallest positive integer that does not appear twice in the partition.

The global dimension of the incidence algebra of the lattice over the rational numbers.

The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue. For example, the cycle on four vertices has distance Laplacian $$ \left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right). $$ Its eigenvalues are $0,4,4,6$, so the statistic is $2$. The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore statistic $1$.

The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue. For example, the cycle on four vertices has distance Laplacian $$ \left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right). $$ Its eigenvalues are $0,4,4,6$, so the statistic is $1$. The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore also statistic $1$. The graphs with statistic $n-1$, $n-2$ and $n-3$ have been characterised, see [1].

The monochromatic index of a connected graph. This is the maximal number of colours such that there is a colouring of the edges where any two vertices can be joined by a monochromatic path. For example, a circle graph other than the triangle can be coloured with at most two colours: one edge blue, all the others red.