Related papers: Some New Applications of Toric Geometry

The resultant of two univariate polynomials is an invariant of great importance in commutative algebra and vastly used in computer algebra systems. Here we present an algorithm to compute it over Artinian principal rings with a modified…

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

We introduce toric arrangements, essentially finite families of codimension 1 subtori of a torus or of their cosets, as a periodic generalization of hyperplane arrangements, compute cohomology of the complement of such an arrangement and…

The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite…

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…

We propose a new geometric method of IR factorization in sector decomposition. The problem is converted into a set of problems in convex geometry. The latter problems are solved using algorithms in combinatorial geometry. This method…

We investigate branching of solutions to holonomic bivariate hypergeometric systems of Horn's type. Special attention is paid to the invariant subspace of Puiseux polynomial solutions. We mainly study Horn systems defined by simplicial…

We present new techniques for reducing a multivariate sparse polynomial to a univariate polynomial. The reduction works similarly to the classical and widely-used Kronecker substitution, except that we choose the degrees randomly based on…

We introduce the short toric polynomial associated to a graded Eulerian poset. This polynomial contains the same information as the two toric polynomials introduced by Stanley, but allows different algebraic manipulations. The intertwined…

Decomposing an algebraic variety into irreducible or equidimensional components is a fundamental task in classical algebraic geometry and has various applications in modern geometry engineering. Several researchers studied the problem and…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

In this article we study infinitesimal deformations of toric hypersurfaces. We introduce a Kodaira-Spencer map and compute its kernel. By introducing some new Laurent polynomials we make our computation as explicit as possible. This widely…

We study symplectic forms on hypersurface algebroids. These are a broad generalization of the $b^{k}$-Poisson structures studied extensively by Miranda, Scott, and collaborators, and their geometry is intimately related to the group of…

By recasting metrical geometry in a purely algebraic setting, both Euclidean and non-Euclidean geometries can be studied over a general field with an arbitrary quadratic form. Both an affine and a projective version of this new theory are…

Finding the solutions to a system of multivariate polynomial equations is a fundamental problem in mathematics and computer science. It involves evaluating the polynomials at many points, often chosen from a grid. In most current methods,…

Subresultant of two univariate polynomials is a fundamental object in computational algebra and geometry with many applications (for instance, parametric GCD and parametric multiplicity of roots). In this paper, we generalize the theory of…

We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…

Given the toric (or toral) arrangement defined by a root system $\Phi$, we describe the poset of its layers (connected components of intersections) and we count its elements. Indeed we show how to reduce to zero-dimensional layers, and in…

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

Efficient handling of sparse data is a key challenge in Computer Science. Binary convolutions, such as polynomial multiplication or the Walsh Transform are a useful tool in many applications and are efficiently solved. In the last decade,…