Cohen-Macaulay types of Hall lattices (Q1355162)

Let \(P\) be a finite poset, \(k\) be a field and \(k[P]\) be the Stanley-Reisner ring of \(P\) over \(k\) [see \textit{R. Stanley}, Combinatorics and commutative algebra (Prog. Math. 41) (1983; Zbl 0537.13009)]. If \(k[P]\) is the Cohen-Macaulay ring, the poset \(P\) is called Cohen-Macaulay (finite modular lattices are examples). The Cohen-Macaulay type is the minimal number of generators of the canonical module of \(k[P]\). This invariant gives refined classification of Cohen-Macaulay posets. A combinatorial formula for the type of a modular lattice \(P\) has been found by \textit{T. Hibi} [J. Algebra 168, 780-797 (1994; Zbl 0813.06004)] in terms of the Möbius function of a poset of minimal essential chains associated with \(P\). Previously [in Graphs Comb. 11, 275-283 (1995; Zbl 0838.13016)] the author investigated Cohen-Macaulay types of subgroup lattices of finite Abelian \(p\)-groups and proved that they are polynomials in \(p\). Here he considers the more general case of Hall lattices (i.e., the submodule lattices of finite modules over a discrete valuation ring [see \textit{I. G. Macdonald}, Symmetric functions and Hall polynomials, 2nd ed. (1995; Zbl 0824.05059)] and shows that their types are polynomials in \(q\) with integer coefficients (\(q\) is the number of elements of the residue field of the discrete valuation ring). The proof is based on the result of T. Hibi.