Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

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

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

Similar works

Full text

thumbnail-image

MPG.PuRe

redirect
Last time updated on 23/08/2016

This paper was published in MPG.PuRe.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.