arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.13202math.MGcs.DMq-bio.PE
收藏

子树距离、紧致张量与多样性

Subtree Distances, Tight Spans and Diversities

David Bryant, Katharina T. Huber, Vincent Moulton, Andreas Spillner

AI总结:

本文研究集合到度量空间子集的嵌入,刻画了距离具有子树表示的条件,推广了Hirai的有限情形结果,建立了一般距离空间的紧致张量理论,并首次刻画了多样性何时具有树状紧致张量。

摘要:

度量嵌入是度量理论及其应用的核心。在此我们考虑一种不同类型的嵌入:从集合到度量空间子集的映射,使得点之间的距离由子集之间的最小距离来近似。我们的主要结果是对集合X中元素之间的距离d(x,y)何时具有子树表示的刻画,即存在一个实树T和T的子树集合{S_x}_{x∈X},使得对所有x,y∈X,d(x,y)等于T中从S_x中某点到S_y中某点的最短路径长度。该刻画最初由Hirai(2006)针对有限X建立,使用的是为距离空间(没有三角不等式的度量空间)定义的紧致张量构造。为了将Hirai的结果推广到无限X,我们建立了一般距离空间的紧致张量理论基础,包括一个令人惊讶的观察:距离空间的紧致张量是超凸的。我们应用这些结果,首次刻画了多样性(度量空间的推广,它对X的所有有限子集赋值,而不仅是对子集对赋值)何时具有树状的紧致张量。

英文摘要:

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 between subsets. Our main result is a characterization of when a set of distances $d(x,y)$ between elements in a set $X$ have a subtree representation, a real tree $T$ and a collection $\{S_x\}_{x \in X}$ of subtrees of~$T$ such that $d(x,y)$ equals the length of the shortest path in~$T$ from a point in $S_x$ to a point in $S_y$ for all $x,y \in X$. The characterization was first established for {\em finite} $X$ by Hirai (2006) using a tight span construction defined for distance spaces, metric spaces without the triangle inequality. To extend Hirai's result beyond finite $X$ we establish fundamental results of tight span theory for general distance spaces, including the surprising observation that the tight span of a distance space is hyperconvex. We apply the results to obtain the first characterization of when a diversity -- a generalization of a metric space which assigns values to all finite subsets of $X$, not just to pairs -- has a tight span which is tree-like.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑