Computing minimal Gorenstein covers
Abstract
We analyze and present an effective solution to the minimal Gorenstein cover problem: given a local Artin k-algebra A = k[[x 1 ,. .. x n ]]/I, compute an Artin Gorenstein k-algebra G = k[[x 1 ,. .. x n ]]/J such that (G)--(A) is minimal. We approach the problem by using Macaulay's inverse systems and a modification of the integration method for inverse systems to compute Gorenstein covers. We propose new characterizations of the minimal Gorenstein cover and present a new algorithm for the effective computation of the variety of all minimal Gorenstein covers of A for low Gorenstein colength. Experimentation illustrates the practical behavior of the method.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.