Finding Sparse Systems of Parameters

Preprint

20 May 1993

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.alg-geom/9305010

Abstract

For 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].

Keywords

NOETHER NORMALIZATIONS
HUNEKE VASCONCELOS
POLYNOMIAL IDEAL
FINDING RADICALS
EISENBUD HUNEKE
FINDING SPARSE
VASCONCELOS

All Related Versions

Version 1, 1993-05-20, ArXiv

This publication has 0 references indexed in Scilit: