相关论文: Dissimilarity vectors of trees are contained in th…

In this article, we will prove that the set of 4-dissimilarity vectors of n-trees is contained in the tropical Grassmannian G_{4,n}. We will also propose three equivalent conjectures related to the set of m-dissimilarity vectors of n-trees…

We give another proof that $m$-dissimilarity vectors of weighted trees are points on the tropical Grassmanian, as conjectured by Cools, and proved by Giraldo in response to a question of Sturmfels and Pachter. We accomplish this by relating…

In 2004 Pachter and Speyer introduced the higher dissimilarity maps for phylogenetic trees and asked two important questions about their relation to the tropical Grassmannian. Multiple authors, using independent methods, answered…

We revisit the representation theory in type $A$used previously to establish that the dissimilarity vectors of phylogenetic trees are points on the tropical Grassmannian variety. We use a different version of this construction to show that…

Let T be a weighted tree with n numbered leaves and let D be its distance matrix, so D(i,j) is the distance between the leaves i and j. If m is an integer between 2 and n, we prove a tropical formula to compute the m-dissimilarity map of T…

Let T be a (not necessarily positive) weighted tree with n leaves numbered by the set {1,...,n}. Define the k-weights of the tree D_{i_1,....,i_k}(T) as the sum of the lengths of the edges of the minimal subtree connecting i_1,....,i_k. We…

The space of phylogenetic trees arises naturally in tropical geometry as the tropical Grassmannian. Tropical geometry therefore suggests a natural notion of a tropical path between two trees, given by a tropical line segment in the tropical…

We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result confirms, for…

In this paper we study tropicalization of Grassmannian and linear varieties. In particular, we study the tropical linear spaces cor- responding to the phylogenetic trees. We prove that corresponding to each subtree of the phylogenetic tree…

In this paper and a companion paper, we prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as…

The greedy tree $\mathcal{G}(D)$ and the $\mathcal{M}$-tree $\mathcal{M}(D)$ are known to be extremal among trees with degree sequence $D$ with respect to various graph invariants. This paper provides a general theorem that covers a large…

We undertake a combinatorial study of the piecewise linear map g : R^{2m+2n} --> R^{mn} which assigns to the four vectors a, A in R^m and b, B in R^n the m by n matrix given by g_{ij} = min (a_i + b_j, A_i+B_j). This map arises naturally in…

We prove a generalization of Kirchhoff's matrix-tree theorem in which a large class of combinatorial objects are represented by non-Gaussian Grassmann integrals. As a special case, we show that unrooted spanning forests, which arise as a q…

In tropical algebraic geometry, the solution sets of polynomial equations are piecewise-linear. We introduce the tropical variety of a polynomial ideal, and we identify it with a polyhedral subcomplex of the Grobner fan. The tropical…

We study higher-dimensional analogues of graph-theoretic trees within the class of pure n-simplicial complexes. Focusing on the case m = n-1 in Dewdney's (m, n)-tree framework, we introduce refined notions of path and circuit sequences that…

Let T be the category whose objects are rooted trees and morphisms are order embeddings preserving the root. We prove that finitely generated representations of T are Noetherian using techniques developed by Sam and Snowden which generalize…

We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…

The Cayley-Menger variety is the Zariski closure of the set of vectors specifying the pairwise squared distances between $n$ points in $\mathbb{R}^d$. This variety is fundamental to algebraic approaches in rigidity theory. We study the…

The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…

The $\textit{$m$-deck}$ of an $n$-vertex graph is the multiset of unlabeled induced subgraphs with $m$ vertices. Caterpillars are trees in which all nonleaf vertices lie on a single path. We prove for $n\ge48$ that any $n$-vertex…