Related papers: Algorithms for computing mixed multiplicities, mix…
We define a version of multiplier ideals, the Mather multiplier ideals, on a variety with arbitrary singularities, using the Mather discrepancy and the Jacobian ideal. In this context we prove a relative vanishing theorem, thus obtaining…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…
A primary ideal in a polynomial ring can be described by the variety it defines and a finite set of Noetherian operators, which are differential operators with polynomial coefficients. We implement both symbolic and numerical algorithms to…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
In this paper we make a systematic study of the multiplicity of the jumping points associated to the mixed multiplier ideals of a family of ideals in a complex surface with rational singularities. In particular we study the behaviour of the…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…
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…
The notion of epsilon multiplicity was originally defined by Ulrich and Validashti as a limsup and they used it to detect integral dependence of modules. It is important to know if it can be realized as a limit. In this article we show that…
We present a software suite for the analysis and optimization of ideal convex polyhedra in hyperbolic 3-space $\mathbb{H}^3$. Using Rivin's variational characterization of ideal polyhedra, we develop efficient algorithms for checking…
We associate convex regions in R^n to m-primary graded sequences of subspaces, in particular m-primary graded sequences of ideals, in a large class of local algebras (including analytically irreducible local domains). These convex regions…
We study a mixed integer linear program with m integer variables and k non-negative continuous variables in the form of the relaxation of the corner polyhedron that was introduced by Andersen, Louveaux, Weismantel and Wolsey [Inequalities…
This paper develops a theory of isolated hypersurface singularities in mixed characteristic $(0,p)$, focusing on quotient rings over a Discrete Valuation Ring (DVR). We introduce and study analogues of the classical Tjurina and Milnor…
We investigate the relationship among several numerical invariants associated to a (free) projective hypersurface $V$: the sequence of mixed multiplicities of its Jacobian ideal, the Hilbert polynomial of its Milnor algebra, and the…
We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…
Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…
We compute the multiplier ideals of hyperplane arrangements via the interpretation of these ideals in terms of spaces of arcs, due to Ein, Lazarsfeld and the author.
We study multiplicities of jumping numbers of multiplier ideals in a smooth variety of arbitrary dimension. We prove that the multiplicity function is a quasi-polynomial, hence proving that the Poincar\'e series is a rational function. We…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…