Related papers: Tropical geometry of PERT
Metric graphs are important models for capturing the structure of complex data across various domains. While much effort has been devoted to extracting geometric and topological features from graph data, computational aspects of metric…
The algebraic degree of a network game measures the complexity of its totally mixed Nash equilibria. For sparse multilinear network games, Datta's formula expresses this degree combinatorially in terms of a permanent, but the geometric…
We consider tropical hemispaces, defined as tropically convex sets whose complements are also tropically convex, and tropical semispaces, defined as maximal tropically convex sets not containing a given point. We introduce the concept of…
We constructs a new network by superposition of hexahedron , which are scale-free, highly sparse,disassortative ,and maximal planar graphs. The network degree distribution, agglomeration coefficient and degree of correlation are computed…
This article discusses the concept of rational equivalence in tropical geometry (and replaces the older and imperfect version arXiv:0811.2860). We give the basic definitions in the context of tropical varieties without boundary points and…
We introduce a simple, easy to implement, and computationally efficient tropical convolutional neural network architecture that is robust against adversarial attacks. We exploit the tropical nature of piece-wise linear neural networks by…
The prime motivation behind this paper is to prove that any torus link 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.…
We define the tropical moduli space of covers of a tropical line in the plane as weighted abstract polyhedral complex, and the tropical branch map recording the images of the simple ramifications. Our main result is the invariance of the…
This article is a survey of recent developments in, and a tutorial on, the approach to P v. NP and related questions called Geometric Complexity Theory (GCT). It is written to be accessible to graduate students. Numerous open questions in…
We show that the tropical projective Grassmannian of planes is homeomorphic to a closed subset of the analytic Grassmannian in Berkovich's sense by constructing a continuous section to the tropicalization map. Our main tool is an explicit…
Tropical geometry has recently found several applications in the analysis of neural networks with piecewise linear activation functions. This paper presents a new look at the problem of tropical polynomial division and its application to…
A net is a special configuration of lines and points in the projective plane. There are certain restrictions on the number of its lines and points. We proved that there cannot be any (4,4) nets in $\mathbb{C}P^2$. In order to show this, we…
We study the algebraic structure of the semigroup of all $2 \times 2$ tropical matrices under multiplication. Using ideas from tropical geometry, we give a complete description of Green's relations and the idempotents and maximal subgroups…
Network theory provides various tools for investigating the structural or functional topology of many complex systems found in nature, technology and society. Nevertheless, it has recently been realised that a considerable number of systems…
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…
We give an explicit upper bound for the degree of a tropical basis of a homogeneous polynomial ideal. As an application f-vectors of tropical varieties are discussed. Various examples illustrate differences between Gr\"obner and tropical…
Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory.
We establish first parts of a tropical intersection theory. Namely, we define cycles, Cartier divisors and intersection products between these two (without passing to rational equivalence) and discuss push-forward and pull-back. We do this…
We introduce tropical dual numbers as an extension of tropical semiring. By this innovation, one can work with honest ideals, instead of congruences, and recover the Euclidean topology on affine tropical spaces similar to Zariski's approach…
We present an algorithm for computing zero-dimensional tropical varieties based on triangular decomposition and Newton polygon methods. From it, we derive algorithms for computing points on and links of higher-dimensional tropical…