Finding Sparse Systems of Parameters

Simple item page
dc.creatorEisenbud, David
dc.creatorSturmfels, Bernd
dc.date1993-05-20
dc.date.accessioned2026-07-07T09:05:50Z
dc.date.available2026-07-07T09:05:50Z
dc.descriptionFor several computational procedures such as finding radicals and Noether normalizations, it is important to choose as sparse as possible a system of parameters in a polynomial ideal or modulo a polynomial ideal. We describe new strategies for these tasks, thus providing solutions to problems (1) and (2) posed in [Eisenbud-Huneke-Vasconcelos 1992].
dc.description15 pages, plainTEX
dc.identifierhttps://arxiv.org/abs/alg-geom/9305010
dc.identifierhttp://arxiv.org/abs/alg-geom/9305010
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/149812
dc.subjectAlgebraic Geometry
dc.subjectCommutative Algebra
dc.titleFinding Sparse Systems of Parameters
dc.typetext

Files

Collections

arXiv