The 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$.

The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra.

The number of indecomposable projective-injective modules in the algebra corresponding to a subset. Let $A_n=K[x]/(x^n)$. We associate to a nonempty subset S of an (n-1)-set the module $M_S$, which is the direct sum of $A_n$-modules with indecomposable non-projective direct summands of dimension $i$ when $i$ is in $S$ (note that such modules have vector space dimension at most n-1). Then the corresponding algebra associated to S is the stable endomorphism ring of $M_S$. We decode the subset as a binary word so that for example the subset $S=\{1,3 \} $ of $\{1,2,3 \}$ is decoded as 101.

The number of atoms of a lattice. An element of a lattice is an '''atom''' if it covers the least element.

The number of doubly irreducible elements of a lattice. An element $d$ of a lattice $L$ is '''doubly irreducible''' if it is both join and meet irreducible. That means, $d$ is neither the least nor the greatest element of $L$ and if $d=x\vee y$ or $d=x\wedge y$, then $d\in\{x,y\}$ for all $x,y\in L$. In a finite lattice, the doubly irreducible elements are those which cover and are covered by a unique element.

The number of maximal proper sublattices of a lattice.

The Möbius invariant of a lattice. The '''Möbius invariant''' of a lattice $L$ is the value of the Möbius function applied to least and greatest element, that is $\mu(L)=\mu_L(\hat{0},\hat{1})$, where $\hat{0}$ is the least element of $L$ and $\hat{1}$ is the greatest element of $L$. For the definition of the Möbius function, see [[St000914]].

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

The number of modular elements of a lattice. A pair $(x, y)$ of elements of a lattice $L$ is a modular pair if for every $z\geq y$ we have that $(y\vee x) \wedge z = y \vee (x \wedge z)$. An element $x$ is left-modular if $(x, y)$ is a modular pair for every $y\in L$, and is modular if both $(x, y)$ and $(y, x)$ are modular pairs for every $y\in L$.

The number of left modular elements of a lattice. A pair $(x, y)$ of elements of a lattice $L$ is a modular pair if for every $z\geq y$ we have that $(y\vee x) \wedge z = y \vee (x \wedge z)$. An element $x$ is left-modular if $(x, y)$ is a modular pair for every $y\in L$.