Related papers: How to Draw Tropical Planes
We consider the tropicalization of tangent lines to a complete intersection curve $X$ in $\mathbb{P}^n$. Under mild hypotheses, we describe a procedure for computing the tropicalization of the image of the Gauss map of $X$ in terms of the…
This paper provides an overview of recent progress on the interplay between tropical geometry and non-archimedean analytic geometry in the sense of Berkovich. After briefly discussing results by Baker, Payne and Rabinoff in the case of…
The problem of comparing probability distributions is at the heart of many tasks in statistics and machine learning. Established comparison methods treat the standard setting that the distributions are supported in the same space. Recently,…
While the positive Grassmannian is deeply understood through the rich combinatorics of plabic graphs and positroid cells, its tropical counterpart, the positive tropical Grassmannian Trop$_{>0}G(k,n)$, has lacked a comparable structural…
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
Tropical algebraic geometry offers new tools for elimination theory and implicitization. We determine the tropicalization of the image of a subvariety of an algebraic torus under any homomorphism from that torus to another torus.
Over the past decade, we witness an increasing amount of interest in the design of exact exponential-time and parameterized algorithms for problems in Graph Drawing. Unfortunately, we still lack knowledge of general methods to develop such…
Tropical Geometry and Mathematical Morphology share the same max-plus and min-plus semiring arithmetic and matrix algebra. In this chapter we summarize some of their main ideas and common (geometric and algebraic) structure, generalize and…
We define tropical analogues of the notions of linear space and Plucker coordinate and study their combinatorics. We introduce tropical analogues of intersection and dualization and define a tropical linear space built by repeated…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…
A class of matroids is introduced which is very large as it strictly contains all paving matroids as special cases. As their key feature these split matroids can be studied via techniques from polyhedral geometry. It turns out that the…
A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…
In this paper we give an interpretation to the boundary points of the compactification of the parameter space of convex projective structures on an n-manifold M. These spaces are closed semi-algebraic subsets of the variety of characters of…
Every graph $\Gamma$ can be embedded in the plane with a minimal number of edge intersections, called its classical crossing number $\text{cross}\left(\Gamma\right)$. In this paper, we prove that if $\Gamma$ is a metric graph it can be…
Given a tropical divisor $D$ in the intersection of two tropical plane curves, we study when it can be realized as the tropicalization of the intersection of two algebraic curves, and give a sufficient condition. We show that under a…
The LR-drawing-method is a method of drawing an ordered rooted binary tree based on drawing one root-to-leaf path on a vertical line and attaching recursively obtained drawings of the subtrees on the left and right. In this paper, we study…
The visual complexity of a graph drawing can be measured by the number of geometric objects used for the representation of its elements. In this paper, we study planar graph drawings where edges are represented by few segments. In such a…
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
We study cubic rational maps that take lines to plane curves. A complete description of such cubic rational maps concludes the classification of all planarizations, i.e., maps taking lines to plane curves.
We present two effective tools for computing the positive tropicalization of algebraic varieties. First, we outline conditions under which the initial ideal can be used to compute the positive tropicalization, offering a real analogue to…