English

Solving Polynomial Equations with Equation Constraints: the Zero-dimensional Case

Symbolic Computation 2014-08-19 v1

Abstract

A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal II, we study its complex zeros that locate in another variety V(J)\textbf{V}(J) where JJ is an arbitrary ideal. The main problem is that for a point in V(I)V(J)=V(I+J)\textbf{V}(I) \cap \textbf{V}(J)=\textbf{V}(I+J), its multiplicities w.r.t. II and I+JI+J may be different. Therefore, we cannot get the multiplicity of this point w.r.t. II by studying I+JI + J. A straightforward way is that first compute the points of V(I+J)\textbf{V}(I + J), then study their multiplicities w.r.t. II. But the former step is difficult to realize exactly. In this paper, we propose a natural geometric explanation of the localization of a polynomial ring corresponding to a semigroup order. Then, based on this view, using the standard basis method and the border basis method, we introduce a way to compute the complex zeros of II in V(J)\textbf{V}(J) with their multiplicities w.r.t. II. As an application, we compute the sum of Milnor numbers of the singular points on a polynomial hypersurface and work out all the singular points on the hypersurface with their Milnor numbers.

Cite

@article{arxiv.1408.3639,
  title  = {Solving Polynomial Equations with Equation Constraints: the Zero-dimensional Case},
  author = {Ye Liang},
  journal= {arXiv preprint arXiv:1408.3639},
  year   = {2014}
}
R2 v1 2026-06-22T05:30:27.522Z