Computing multiplicity sequences
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910383383511040 |
|---|---|
| author | Chen, Justin Kim, Youngsu Montaño, Jonathan |
| author_facet | Chen, Justin Kim, Youngsu Montaño, Jonathan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2103_14175 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Computing multiplicity sequences Chen, Justin Kim, Youngsu Montaño, Jonathan Commutative Algebra 13H15, 13-04 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. |
| title | Computing multiplicity sequences |
| topic | Commutative Algebra 13H15, 13-04 |
| url | https://arxiv.org/abs/2103.14175 |