On the Computation of Matrices of Traces and Radicals of Ideals
Abstract
Let f1,...,fs ∈ K[x1,...,xm] be a system of polynomials generating a zero-dimensional ideal , where K is an arbitrary algebraically closed field. We study the computation of "matrices of traces" for the factor algebra := [x1, ..., xm]/ , i.e. matrices with entries which are trace functions of the roots of . Such matrices of traces in turn allow us to compute a system of multiplication matrices \Mxi|i=1,...,m\ of the radical . We first propose a method using Macaulay type resultant matrices of f1,...,fs and a polynomial J to compute moment matrices, and in particular matrices of traces for . Here J is a polynomial generalizing the Jacobian. We prove bounds on the degrees needed for the Macaulay matrix in the case when has finitely many projective roots in Pm. We also extend previous results which work only for the case where is Gorenstein to the non-Gorenstein case. The second proposed method uses Bezoutian matrices to compute matrices of traces of . Here we need the assumption that s=m and f1,...,fm define an affine complete intersection. This second method also works if we have higher dimensional components at infinity. A new explicit description of the generators of are given in terms of Bezoutians.
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.