Algorithmic computation of polynomial amoebas

It is shown that tube sets over amoebas of algebraic varieties (and, more generally, of almost periodic holomorphic chains) of dimension q are q-pseudoconcave in the sense of Rothstein. This is a direct consequence of a representation of such sets as supports of positive closed currents.

Amoebas are projections of complex algebraic varieties in the algebraic torus under a Log-absolute value map, which have connections to various mathematical subjects. While amoebas of hypersurfaces have been intensively studied in recent years, the non-hypersurface case is barely understood so far. We investigate intersections of amoebas of $n$ hypersurfaces in $(\mathbb{C}^*)^n$, which are canonical supersets of amoebas given by non-hypersurface varieties. Our main results...

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 ideas of Hauenstein and Sottile. Additionally, we construct a numerical tropical membership algorithm which uses the former algorithm as a subroutine. Based on recent results of Esterov, we give an algorithm which recursively solves a sparse ...

We characterise Newton polytopes of nondegenerate quadratic forms and Newton polyhedra of Morse singularities.

We present a method of constructing non-normal very ample polytopes as a segmental fibration of unimodular graph polytopes. In many cases we explicitly compute their invariants - Hilbert function, Ehrhart polynomial, gap vector. In particular, we answer several questions posed by Beck, Cox, Delgado, Gubeladze, Haase, Hibi, Higashitani and Maclagan.

We give a complete description of amoebas and coamoebas of $k$-dimensional very affine linear spaces in $(\mathbb{C}^*)^{n}$. This include an upper bound of their dimension, and we show that if a $k$-dimensional very affine linear space in $(\mathbb{C}^*)^{n}$ is generic, then the dimension of its (co)amoeba is equal to $\min \{ 2k, n\}$. Moreover, we prove that the volume of its coamoeba is equal to $\pi^{2k}$. In addition, if the space is generic and real, then the volume o...

We present an algorithm for computing the main topological characteristics of three-dimensional bodies. The algorithm is based on a discretization of Morse theory and uses discrete analogs of smooth functions with only nondegenerate (Morse) and the simplest degenerate critical points.

The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials (written as sums of monomials). We give recurrence formulae w.r.t. arbitrary affine frames. As a corollary, it is amusing that we can also give closed-form expressions in the case of the frame (r, s) for curves, and the frame ((1, 0, 0), (0, 1, 0), (0, 0, 1) for surfaces. Our methods have the same l...

This paper studies the configuration space of all possible positions of a linkage in R^n. For example, it shows that for every compact algebraic set, there is a linkage whose configuration space is analytically isomorphic to a finite number of copies of the algebraic set. If flexible edges are allowed, any compact set given by polynomial equalities and inequalities is the configuration space of a linkage. This paper also characterizes functions which can be computed by linkag...

Illumination of scenes is usually generated in computer graphics using polygonal meshes. In this paper, we present a geometric method using projections. Starting from an implicit polynomial equation of a surface in 3-D or a curve in 2-D, we provide a semi-algebraic representation of each part of the construction. To solve polynomial condition systems and find constrained regions, we apply algebraic computational algorithms for computing the Gr{\" o}bner basis and cylindrical ...