Algorithmic computation of polynomial amoebas

In this paper we present a Java implementation of the algorithm that computes Buchbereger's and reduced Groebner's basis step by step. The Java application enables graphical representation of the intersection of two surfaces in 3-dimensional space and determines conditions of existence and planarity of the intersection.

For applications in computing, Bezier curves are pervasive and are defined by a piecewise linear curve L which is embedded in R^3 and yields a smooth polynomial curve C embedded in R^3. It is of interest to understand when L and C have the same embeddings. One class of counterexamples is shown for L being unknotted, while C is knotted. Another class of counterexamples is created where L is equilateral and simple, while C is self-intersecting. These counterexamples were discov...

We apply methods of machine-learning, such as neural networks, manifold learning and image processing, in order to study 2-dimensional amoebae in algebraic geometry and string theory. With the help of embedding manifold projection, we recover complicated conditions obtained from so-called lopsidedness. For certain cases it could even reach $\sim99\%$ accuracy, in particular for the lopsided amoeba of $F_0$ with positive coefficients which we place primary focus. Using weights...

We completely characterize sections of the cones of nonnegative polynomials, convex polynomials and sums of squares with polynomials supported on circuits, a genuine class of sparse polynomials. In particular, nonnegativity is characterized by an invariant, which can be immediately derived from the initial polynomial. Furthermore, nonnegativity of such polynomials $f$ coincides with solidness of the amoeba of $f$, i.e., the Log-absolute-value image of the algebraic variety $\...

The prime motivation behind this paper is to prove that any torus link $\mathcal{L}$ can be realized as the union of the one-dimensional connected components of the set of critical values of the argument map restricted to a complex algebraic plane curve. Moreover, given an isolated complex algebraic plane curve quasi-homogeneous singularity, we give an explicit topological and geometric description of the link $\mathcal{L}$ corresponding to this singularity. In other words, w...

This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The problems are grouped into the sections ``Coordinate Descriptions'', ``Combinatorial Structure'', ``Isomorphism'', ``Optimization'', ``Realizability'', and ``Beyond Polytopes''.

The aim of this paper is to discuss some applications of general topology in computer algorithms including modeling and simulation, and also in computer graphics and image processing. While the progress in these areas heavily depends on advances in computing hardware, the major intellectual achievements are the algorithms. The applications of general topology in other branches of mathematics are not discussed, since they are not applications of mathematics outside of mathemat...

In this paper we prove the topological uniqueness of maximal arrangements of a real plane algebraic curve with respect to three lines. More generally, we prove the topological uniqueness of a maximally arranged algebraic curve on a real toric surface. We use the moment map as a tool for studying the topology of real algebraic curves and their complexifications.

In this paper we prove that the only algebraic constant mean curvature (cmc) surfaces in R^3 of order less than four are the planes, the spheres and the cylinders. The method used heavily depends on the efficiency of algorithms to compute Groebner Bases and also on the memory capacity of the computer used to do the computations. We will also prove that the problem of finding algebraic constant mean curvature hypersurfaces in the Euclidean space completely reduces to the probl...

We study coamoebas of polynomials supported on circuits. Our results include an explicit description of the space of coamoebas, a relation between connected components of the coamoeba complement and critical points of the polynomial, an upper bound on the area of a planar coamoeba, and a recovered bound on the number of positive solutions of a fewnomial system.