Algebraic and geometric reasoning using Dixon resultants
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Comparison of various multivariate resultant formulations
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Sparsity considerations in Dixon resultants
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Multivariate Bezoutians, Kronecker symbol and Eisenbud-Levine formula
Algorithms in algebraic geometry and applications
Computing multidimensional residues
Algorithms in algebraic geometry and applications
A computational method for diophantine approximation
Algorithms in algebraic geometry and applications
Implicitization of parametric curves and surfaces by using multidimensional Newton formulae
Journal of Symbolic Computation - Special issue: parametric algebraic curves and applications
Extraneous factors in the Dixon resultant formulation
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Computing the isolated roots by matrix methods
Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
A new algorithm for the geometric decomposition of a variety
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Generalized resultants over unirational algebraic varieties
Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
Determinantal formula for the chow form of a toric surface
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Curve/surface intersection problem by means of matrix representations
Proceedings of the 2009 conference on Symbolic numeric computation
On the computation of matrices of traces and radicals of ideals
Journal of Symbolic Computation
| Hi-index | 0.00 |
In this paper, we present different results related to bezoutian and residue theory. We consider, in particular, the problem of computing the structure of the quotient ring by an affine complete intersection, and an algorithm to obtain it, as conjectured in [Cardinal, J.-P., 1993. Dualite et algorithmes iteratifs pour la resolution de systemes polynomiaux. Ph.D. Thesis, Univ. de Rennes]. We analyze it in detail and prove the validity of the conjecture, for a modification of the initial method. Direct applications of the results in effective algebraic geometry are given.