Mora’s holy graal: Algorithms for computing in localizations at prime ideals
This paper discusses a computational treatment of the localization [Formula: see text] of an affine coordinate ring [Formula: see text] at a prime ideal [Formula: see text] and its associated graded algebra [Formula: see text] with the means of computer algebra. Building on Mora’s paper [T. Mora, La queste del Saint [Formula: see text]: A computational approach to local algebra, Discrete Appl. Math. 33 (1991) 161–190], we present shorter proofs on two of the central statements and expand on the applications touched by Mora: resolutions of ideals, systems of parameters and Hilbert polynomials, as well as dimension and regularity of [Formula: see text]. All algorithms are implemented in the library graal.lib for the computer algebra system Singular.