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

We solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] concerning the threshold for the containment of all bounded degree spanning trees in the model of randomly perturbed dense graphs.…

The tree metric theorem provides a combinatorial four point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A similar (but weaker) four point condition characterizes dissimilarity maps derived…

One theorem of Nemhauser and Trotter ensures that, under certain conditions, a stable set of a graph G can be enlarged to a maximum stable set of this graph. For example, any stable set consisting of only simplicial vertices is contained in…

We prove general Cramer type theorems for linear systems over various extensions of the tropical semiring, in which tropical numbers are enriched with an information of multiplicity, sign, or argument. We obtain existence or uniqueness…

We give a complete description of Green's D relation for the multiplicative semigroup of all n-by-n tropical matrices. Our main tool is a new variant on the duality between the row and column space of a tropical matrix (studied by Cohen,…

We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…

We try to give a qualitative description of the Godbillon-Vey class and its relation on the one hand to the holonomy and on the other hand to the topological entropy of a foliation, using a remarkable theorem proved recently by G. Duminy…

Metric embeddings are central to metric theory and its applications. Here we consider embeddings of a different sort: maps from a set to subsets of a metric space so that distances between points are approximated by minimal distances…

Among other results, we prove the following theorem about Steiner minimal trees in $d$-dimensional Euclidean space: if two finite sets in $\mathbb{R}^d$ have unique and combinatorially equivalent Steiner minimal trees, then there is a…

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,…

The Gy\'arf\'as tree packing conjecture states that any set of $n-1$ trees $T_{1},T_{2},..., T_{n-1}$ such that $T_i$ has $n-i+1$ vertices pack into $K_n$. We show that $t=1/10n^{1/4}$ trees $T_1,T_2,..., T_t$ such that $T_i$ has $n-i+1$…

We introduce a smooth projective variety $T_{d,n}$ which compactifies the space of configurations of $n$ distinct points on affine $d$-space modulo translation and homothety. The points in the boundary correspond to $n$-pointed stable…

Tree-graded spaces are a generalization of $\mathbb{R}$-trees and play an important role in describing the large-scale geometry of relatively hyperbolic groups. We consider a subclass of tree-graded spaces that we call "disjointly…

A {\em tree cover} of a metric space $(X,d)$ is a collection of trees, so that every pair $x,y\in X$ has a low distortion path in one of the trees. If it has the stronger property that every point $x\in X$ has a single tree with low…

We prove a conjecture by Kreiman and Lakshmibai on a combinatorial description of multiplicities of points on Schubert varieties in Graszmannians in terms of certain sets of reflections in the corresponding Weyl group. The proof is…

Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in…

In this paper, we prove, following earlier work of Waldspurger ([Wa1], [Wa4]), a sort of local relative trace formula which is related to the local Gan-Gross-Prasad conjecture for unitary groups over a local field $F$ of characteristic…

In this paper we obtain precise asymptotics for certain families of graphs, namely circulant graphs and degenerating discrete tori. The asymptotics contain interesting constants from number theory among which some can be interpreted as…

A k-dissimilarity D on a finite set X, |X| >= k, is a map from the set of size k subsets of X to the real numbers. Such maps naturally arise from edge-weighted trees T with leaf-set X: Given a subset Y of X of size k, D(Y) is defined to be…

Fix $n\in\mathbb{N}$. Let $\mathbf{T}_n$ be the set of rooted trees $(T,o)$ whose vertices are labeled by elements of $\{1,...,n\}$. Let $\nu$ be a strongly connected multi-type Galton-Watson measure. We give necessary and sufficient…