A note on the asymptotics of the number of \(O\)-sequences of given length (Q2421869)

This short note provides upper and lower bounds on the number \(L(n)\) of \(O\)-sequences of length \(n\). An \(O\)-sequence \(h = (h_0,h_1,\dots,h_e)\) (where \(n = h_0+h_1+\dots+h_e\)) can be seen as the Hilbert function of some standard graded (Artinian) \(k\)-algebra, or combinatorially as the \(f\)-vector of a multicomplex. The estimates provided are based on the characterisation of \(O\)-sequences due to Macaulay. One has \[ e^{c_1\sqrt{n}} \leq L(n) \leq e^{c_2\sqrt{n}\log n} \] for suitable constants \(c_1,c_2 > 0\) and all \(n > 2\). Both bounds are derived by partition-theoretic arguments.