Computing multiplicity sequences
Justin Chen, Youngsu Kim, Jonathan Montaño
TL;DR
Two strategies implemented for computing multiplicity sequences are discussed: one via the bivariate Hilbert polynomial, and the other via the technique of general elements.
Abstract
The MultiplicitySequence package for Macaulay2 computes the multiplicity sequence of a graded ideal in a standard graded ring over a field, as well as several invariants of monomial ideals related to integral dependence. We discuss two strategies implemented for computing multiplicity sequences: one via the bivariate Hilbert polynomial, and the other via the technique of general elements.