Related papers: Computing mixed multiplicities, mixed volumes, and…
The invariant polytope algorithm was a breakthrough in the joint spectral radius computation, allowing to find the exact value of the joint spectral radius for most matrix families~\cite{GP2013,GP2016}. This algorithm found many…
Numerical Algebraic Geometry uses numerical data to describe algebraic varieties. It is based on the methods of numerical polynomial homotopy continuation, an alternative to the classical symbolic approaches of computational algebraic…
The goal of this note is to present some recent results of our research concerning multiplier ideal sheaves on complex spaces and singularities of plurisubharmonic functions. We firstly introduce multiplier ideal sheaves on complex spaces…
New algorithms are devised for finding the maxima of multidimensional point samples, one of the very first problems studied in computational geometry. The algorithms are very simple and easily coded and modified for practical needs. The…
When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
In this article we present a parallel modular algorithm to compute all solutions with multiplicities of a given zero-dimensional polynomial system of equations over the rationals. In fact, we compute a triangular decomposition using…
We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that…
In the present paper MAPLE subroutines computing Milnor and Tyurina numbers of an isolated algebraic hypersurface singularity are presented and described in detail. They represents examples, and perhaps the first ones, of a MAPLE…
Some methods based on simple regularizing geometric element transformations have heuristically been shown to give runtime efficient and quality effective smoothing algorithms for meshes. We describe the mathematical framework and a…
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…
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…
We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…
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.…
In this paper, we present an algorithm for computing the minimal reductions of $\mathfrak{m}$-primary ideals of Cohen--Macaulay local rings. Using this algorithm, we are able to compute the Hilbert--Samuel multiplicities and solve the…
Macaulay dual spaces provide a local description of an affine scheme and give rise to computational machinery that is compatible with the methods of numerical algebraic geometry. We introduce eliminating dual spaces, use them for computing…
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…
In this article, we present a constructive procedure for determining all ideals of the Borel subalgebra of a complex semisimple Lie algebra from its root system or, equivalently, its Dynkin diagram. The proposed algorithmic approach has…
We present a simple and at the same time fficient algorithm to compute all nondominated extreme points in the outcome set of multi-objective mixed integer linear programmes in any dimension. The method generalizes the well-known dichotomic…
In this paper we present a new algorithm for multivariate interpolation of scattered data sets lying in convex domains $\Omega \subseteq \RR^N$, for any $N \geq 2$. To organize the points in a multidimensional space, we build a $kd$-tree…