Related papers: Algorithms for computing mixed multiplicities, mix…
For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…
In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…
We study the multiplier ideals and the corresponding jumping numbers and multiplicities $\{m(c)\}_{c\in \mathbb{R}}$ in the following context: $(X,o)$ is a complex analytic normal surface singularity, ${\mathfrak a}\subset…
Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…
This work deals with special nested objects arising in massive higher order perturbative calculations in renormalizable quantum field theories. On the one hand we work with nested sums such as harmonic sums and their generalizations…
Let $R$ be a $d$-dimensional Noetherian local ring with maximal ideal $m_R$. In this article, we give a generalization of the multiplicity $e(I)$ of an $m_R$-primary ideal $I$ of $R$ to a multiplicity $e(\mathcal I)$ of a graded family of…
We introduce a spectrum for arbitrary varieties. This generalizes the definition by Steenbrink for hypersurfaces. In the isolated complete intersection singularity case, it coincides with the one given by Ebeling and Steenbrink except for…
The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
This is a survey on the computational complexity of nonlinear mixed-integer optimization. It highlights a selection of important topics, ranging from incomputability results that arise from number theory and logic, to recently obtained…
We develop the notions of Newton non-degenerate (NND) ideals and Newton polyhedra for regular local rings. These concepts were first defined in the context of complex analysis. We show that the characterization of NND ideals via their…
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)$…
As an attempt to bridge between numerical analysis and algebraic geometry, this paper formulates the multiplicity for the general nonlinear system at an isolated zero, presents an algorithm for computing the multiplicity structure, proposes…
This paper gives the additivity and reduction formulas for mixed multiplicities of multi-graded modules $M$ and mixed multiplicities of arbitrary ideals, and establishes the recursion formulas for the sum of all the mixed multiplicities of…
The mixed volume counts the roots of generic sparse polynomial systems. Mixed cells are used to provide starting systems for homotopy algorithms that can find all those roots, and track no unnecessary path. Up to now, algorithms for that…
We give algorithms for computing multiplier ideals using Gr\"obner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato polynomial.…
The present paper is devoted to an algebraic treatment of the joint spectral theory within the framework of Noetherian modules over an algebra finite extension of an algebraically closed field. We prove the spectral mapping theorem and…
We present an algorithm for the classification of triples of lattice polytopes with a given mixed volume $m$ in dimension 3. It is known that the classification can be reduced to the enumeration of so-called irreducible triples, the number…
We describe how to compute topological objects associated to a polynomial map of several complex variables with isolated singularities. These objects are: the affine critical values, the affine Milnor numbers for all irregular fibers, the…