Bar code for monomial ideals (Q1994120)

The problem of listing all stable and strongly atble ideals with a fixed Hilbert polynomial is relevant for the study of Hilbert schemes. The present paper aims to count zerodimensional stable and strongly stable ideals in 2 and 3 variables, given their Hilbert polynomial. For this, the author introduces Bar Codes, which provide a connection between zerodimenional (strongly) stable monomial ideals and integer partitions. The main results of the paper are: \begin{itemize} \item[-] In two variables, there is a bijection between (strongly) stable ideals with affine Hilbert polynomial \(p\) and partitions of \(p\) with distinct parts, cf. Proposition 42. \item[-] In three variables, there is a bijection between (strongly) stable ideals and some special plane partitions of their affine Hilbert polynomial \(p\), cf. Theorem 55, Theorem 64. \end{itemize}