Related papers: Using Tropical Degenerations For Proving The Nonex…
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…
A fundamental problem in the study of phylogenetic networks is to determine whether or not a given phylogenetic network contains a given phylogenetic tree. We develop a quadratic-time algorithm for this problem for binary nearly-stable…
In this paper we use the connections between tropical algebraic geometry and rigid analytic geometry in order to prove two main results. We use tropical methods to prove a theorem about the Newton polygon for convergent power series in…
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…
We call a set of points $Z\subset{\mathbb P}^{3}_{\mathbb C}$ an $(a,b)$-geproci set (for GEneral PROjection is a Complete Intersection) if its projection from a general point $P$ to a plane is a complete intersection of curves of degrees…
In the past decade, geometric network models have received vast attention in the literature. These models formalize the natural idea that similar vertices are likely to connect. Because of that, these models are able to adequately capture…
Let $P$ be a set of $n$ points in the plane that determines at most $n/5$ distinct distances. We show that no line can contain more than $O(n^{43/52}{\rm polylog}(n))$ points of $P$. We also show a similar result for rectangular distances,…
A classic problem in computational biology is constructing a phylogenetic tree given a set of distances between n species. In most cases, a tree structure is too constraining. We consider a circular split network, a generalization of a tree…
This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first one sees places as generators of a commutative monoid and…
Tropical differential equations are introduced and an algorithm is designed which tests solvability of a system of tropical linear differential equations within the complexity polynomial in the size of the system and in its coefficients.…
We study the geometry of the algebraic set of tuples of composable matrices which multiply to a fixed matrix, using tools from the theory of quiver representations. In particular, we determine its codimension $C$ and the number $\theta$ of…
We present results on the relative realizability of infinite families of lines on general smooth tropical cubic surfaces. Inspired by the problem of relative realizability of lines on surfaces, we investigate the information we can derive…
We show that for any large $n$, there exists a set of $n$ points in the plane with $O(n^2/\sqrt{\log n})$ distinct distances, such that any four points in the set determine at least five distinct distances. This answers (in the negative) a…
We study mechanical structures composed of spatial four-bar linkages that are bistable, that is, they allow for two distinct configurations. They have an interpretation as quad nets in the Study quadric which can be used to prove existence…
A Thurston map is called nearly Euclidean if its local degree at each critical point is 2 and it has exactly four postcritical points. Nearly Euclidean Thurston (NET) maps are simple generalizations of rational Lattes maps. We investigate…
A polytrope is a tropical polyhedron that is also classically convex. We study the tropical combinatorial types of polytropes associated to weighted directed acyclic graphs (DAGs). This family of polytropes arises in algebraic statistics…
This work deals with the construction of networks of topological defects in models described by a single complex scalar field. We take advantage of the deformation procedure recently used to describe kinklike defects in order to build…
Phylogenetic networks are used to represent evolutionary scenarios in biology and linguistics. To find the most probable scenario, it may be necessary to compare candidate networks, to distinguish different networks, and to see when one…
A configuration of 7 points in RP2 is called typical if it has no collinear triples and no coconic sextuples of points. We show that there exist 14 deformation classes of such configurations. This yields classification of real Aronhold…
P. Alexandroff proved that a locally compact $T_2$-space has a $T_2$ one-point compactification (obtained by adding a "point at infinity") if and only if it is non-compact. He also asked for characterizations of spaces which have one-point…