SearcharxivSearch

arXiv · 1408.3639

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 $I$, we study its complex zeros that locate in another variety $\textbf{V}(J)$ where $J$ is an arbitrary ideal. The main problem is that for a point in $\textbf{V}(I) \cap \textbf{V}(J)=\textbf{V}(I+J)$, its multiplicities w.r.t. $I$ and $I+J$ may be different. Therefore, we cannot get the multiplicity of this point w.r.t. $I$ by studying $I + J$. A straightforward way is that first compute the points of $\textbf{V}(I + J)$, then study their multiplicities w.r.t. $I$. 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 $I$ in $\textbf{V}(J)$ with their multiplicities w.r.t. $I$. 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Ye Liang. 2014-08-15. Solving Polynomial Equations with Equation Constraints: the Zero-dimensional Case. https://arxiv.org/abs/1408.3639

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Diversity of EML-type operators

The discovery of the EML operator, sufficient to evaluate the standard explicit purely transcendental elementary functions, has led to considerable interest and discussion across multiple scientific disciplines. However, most authors have focused on the binary EML itself, while numerous similar variants with slightly different properties are now known. This article attempts to close this gap by enumerating and classifying them. We also take this opportunity to clarify common misconceptions related to the EML operator. The principal goal, symbolic regression within an architecture as close as possible to proven neural networks which combine matrix multiplication with a single univariate non-linear activation function, remains beyond reach. Instead, we propose a M\"obius layer, with rational functions replacing matrix operations, and showcase the recently discovered activation function eml(x,1/x), which allows exp(x) and ln(x) to be recovered separately, and hence all elementary functions to be evaluated within a rational generalization of the neural network.

cs.SC

Physical Law Ecology: mapping multi-mechanism ecologies as the zeroth step of data-driven scientific discovery

Every data-driven equation discovery method assumes (implicitly and without verification) that the target system obeys a single governing law ($K{=}1$). Here we show that this assumption is the primary bottleneck limiting scientific discovery in multi-mechanism systems, and introduce Physical Law Ecology, a framework that makes $K^*$ (the number of coexisting independent mechanisms) itself the first quantity to be determined from data. The framework automatically mines a pool of topologically distinct candidate equations, constructs a continuous dominance weight field across parameter space, and discovers analytic evolution laws governing mechanism succession---with optional monotonicity constraints encoding irreversible physics. Across four unrelated systems (elastomer mechanics, pool boiling, galactic dynamics, and droplet evaporation), BIC consistently identifies $K^*{=}3$ independent governing topologies. Applied to 163 SPARC galaxies (3,269 spatially resolved measurements), the framework autonomously recovers three gravitational laws whose coexistence provides evidence against the single-universal-acceleration hypothesis of MOND ($p<10^{-34}$). In engineering applications, multi-law weighted prediction reduces error by 67-72\% over single-equation baselines while retaining full interpretability. By establishing the determination of $K^*$ as the zeroth step of scientific discovery-prior to and independent of equation search---this work opens a direction orthogonal to existing symbolic regression: not finding better equations, but mapping the ecology of mechanisms that govern complex systems.

cs.SC