Related papers: Computing mixed multiplicities, mixed volumes, and…

Let R be the local ring of a point on a variety X over an algebraically closed field k. We make a connection between the notion of mixed (Samuel) multiplicity of m-primary ideals in R and intersection theory of subspaces of rational…

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…

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…

Using a certain Pick-type formula for the mixed volume of Cayley polyhedra, we compute the multiplicity of the isolated common zero of the maximal minors for a matrix of generic homogeneous polynomials of given degrees.

We consider the notion of mixed multiplicities for multigraded modules by using Hilbert series, and this is later applied to study the projective degrees of rational maps. We use a general framework to determine the projective degrees of a…

We introduce the DeterminantalRepresentations package for Macaulay2, which computes definite symmetric determinantal representations of real polynomials. We focus on quadrics and plane curves of low degree (i.e. cubics and quartics). Our…

We introduce mixed Segre numbers of ideals which generalize the notion of mixed multiplicities of ideals of finite colength and show how many results on mixed multiplicities can be extended to results on mixed Segre numbers. In particular,…

We present our implementation of an algorithm which functions as a numerical oracle for the Newton polytope of a hypersurface in the Macaulay2 package NumericalNP.m2. We propose a tropical membership test, relying on this algorithm, for…

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…

One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of…

Local digital algorithms based on $n\times \dots \times n$ configuration counts are commonly used within science for estimating intrinsic volumes from binary images. This paper investigates multigrid convergence of such algorithms. It is…

Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…

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…

For a linear equality constrained convex optimization problem involving two objective functions with a ``nonsmooth" + ``nonsmooth" composite structure, we study two algorithms derived from a mixed-order dynamical system which incorporates…

The power of Clifford or, geometric, algebra lies in its ability to represent geometric operations in a concise and elegant manner. Clifford algebras provide the natural generalizations of complex, dual numbers and quaternions into…

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…

We introduce a new division formula on projective space which provides explicit solutions to various polynomial division problems with sharp degree estimates. We consider simple examples as the classical Macaulay theorem as well as a quite…

Cutting planes for mixed-integer linear programs (MILPs) are typically computed in rounds by iteratively solving optimization problems, the so-called separation. Instead, we reframe the problem of finding good cutting planes as a continuous…

The aim of this paper is to study mixed multiplier ideals associated to a tuple of ideals in a two-dimensional local ring with a rational singularity. We are interested in the partition of the real positive orthant given by the regions…

Our main purpose is to give multiple examples for using the available implementations for computing the normalization of an affine ring, computing the minimial generators of the normalization as an algebra over the original ring and…