Computing multiplicity sequences

DOI10.2140/JSAG.2024.14.13MaRDI QIDQ6505077arXivFDO

Authors Justin Chen, Youngsu Kim, Jonathan Montaño

Published in arXiv

Full work available at URL https://doi.org/10.2140/JSAG.2024.14.13

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to commutative algebra (13-04) Multiplicity theory and related topics (13H15)

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.

This page was built for publication: Computing multiplicity sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6505077)