相关论文: On the frontiers of polynomial computations in tro…
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…
We give an introduction to Tropical Geometry and prove some results in Tropical Intersection Theory. The first part of this paper is an introduction to tropical geometry aimed at researchers in Algebraic Geometry from the point of view of…
In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
We introduce tropical complexes, as an enrichment of the dual complex of a degeneration with additional data from non-transverse intersection numbers. We define cycles, divisors, and linear equivalence on tropical complexes, analogous both…
Tropical geometry is a piecewise linear "shadow" of algebraic geometry. It allows for the computation of several cohomological invariants of an algebraic variety. In particular, its application to enumerative algebraic geometry led to…
Neural networks are important tools in machine learning. Representing piecewise linear activation functions with tropical arithmetic enables the application of tropical geometry. Algorithms are presented to compute regions where the neural…
We consider optimization problems that are formulated and solved in the framework of tropical mathematics. The problems consist in minimizing or maximizing functionals defined on vectors of finite-dimensional semimodules over idempotent…
The shellability of the boundary complex of an unbounded polyhedron is investigated. To this end, it is necessary to pass to a suitable compactification, e.g., by one point. This observation can be exploited to prove that any tropical…
Complex algebraic varieties become easy piecewise-linear objects after passing to the so-called tropical limit. Geometry of these limiting objects is known as tropical geometry. In this short survey we take a look at motivation and…
In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup of square matrices of size $k \times k$ with non-negative…
For certain tropical quartic curves the existing techniques could not predict the lifting behavior of their bitangents over the real numbers. We close this gap by using patchworking techniques. Further, this paper provides an analysis of…
We consider the well-studied problem of finding a spanning tree with minimum average distance between vertex pairs (called a MAD tree). This is a classic network design problem which is known to be NP-hard. While approximation algorithms…
We use tropical and non-archimedean geometry to study the generic number of solutions of families of polynomial equations over a parameter space $Y$. In particular, we are interested in the choices of parameters for which the generic root…
The discriminant of a polynomial map is central to problems from affine geometry and singularity theory. Standard methods for characterizing it rely on elimination techniques that can often be ineffective. This paper concerns polynomial…
We provide some new local obstructions to approximating tropical curves in smooth tropical surfaces. These obstructions are based on the relation between tropical and complex intersection theories which is also established here. We give two…
This is a survey on tropical polytopes from the combinatorial point of view and with a focus on algorithms. Tropical convexity is interesting because it relates a number of combinatorial concepts including ordinary convexity, monomial…
We consider multidimensional optimization problems, which are formulated and solved in terms of tropical mathematics. The problems are to minimize (maximize) a linear or nonlinear function defined on vectors over an idempotent semifield,…
Tropical counting tools are useful for many enumerative questions. We count tropical multinodal surfaces using floor plans, looking at the case when two nodes are tropically close together, i.e., unseparated. We generalize tropical floor…
Patchworking theorems serve as a basic element of the correspondence between tropical and algebraic curves, which is a core of the tropical enumerative geometry. We present a new version of a patchworking theorem which relates plane…