Gröbner bases and primary decomposition of polynomial ideals
Journal of Symbolic Computation
Algebraic solution of systems of polynomial equations using Groebner bases
Proceedings of the 5th international conference, AAECC-5 on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On radical zero-dimensional ideals
Journal of Symbolic Computation
On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Solutions of systems of algebraic equations and linear maps on residue class rings
Journal of Symbolic Computation
Multivariate Bezoutians, Kronecker symbol and Eisenbud-Levine formula
Algorithms in algebraic geometry and applications
Computing multidimensional residues
Algorithms in algebraic geometry and applications
Radical computations of zero-dimensional ideals and real root counting
Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
Computing the isolated roots by matrix methods
Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
An Algorithm for the Computation of the Radical of an Ideal in the Ring of Polynomials
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On the Computation of the Radical of Polynomial Complete Intersection Ideals
AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Using Symmetric Functions to Describe the Solution Set of a Zero Dimensional Ideal
AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Approximate radical of ideals with clusters of roots
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals
Foundations of Computational Mathematics
On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals
Journal of Symbolic Computation
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
On the computation of matrices of traces and radicals of ideals
Journal of Symbolic Computation
Moment matrices, border bases and real radical computation
Journal of Symbolic Computation
Hi-index | 0.01 |
Let f1,..., fs be a system of polynomials in K[x1,..., xm] generating a zero-dimensional ideal I , where K is an arbitrary algebraically closed field. Assume that the factor algebra A = K[x1 , . . . , xm]/I is Gorenstein and that we have a bound delta 0 such that a basis for A can be computed from multiples of f1,..., fs of degrees at most delta. We propose a method using Sylvester or Macaulay type resultant matrices of f1,..., fs and J , where J is a polynomial of degree delta generalizing the Jacobian, to compute moment matrices, and in particular matrices of traces for A. These matrices of traces in turn allow us to compute a system of multiplication matrices {Mxi|i = 1,..., m} of the radical of I, following the approach in the previous work by Janovitz-Freireich, Ronyai and Szanto. Additionally, we give bounds for delta for the case when I has finitely many projective roots.