arXiv · 2103.14175
Computing multiplicity sequences
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.
Explore related subjects
Keep this discovery
Justin Chen, Youngsu Kim, Jonathan Montaño. 2021-03-25. Computing multiplicity sequences. https://doi.org/10.2140/jsag.2024.14.13
Cite the original work for its findings. Save a collection to share your selection of sources.