arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.0048math.CO
收藏

正n点树的Buneman定理

Buneman's theorem for trees with exatcly n vertices

Agnese Baldisserri

摘要:

设${\cal T}=(T,w)$是一个至少有$n$顶点的正加权树。对于任何$i,j \in \{1,...,n\}$,令$D_{i,j} ({\cal T})$为$T$中连接$i$和$j$的唯一路径的权重。$D_{i,j} ({\cal T})$被称为${\cal T}$的$2$ -权重,并且如果我们将$2$ -权重排序,则具有$D_{i,j} ({\cal T})$作为分量的向量被称为$ {\cal T}$的\emph{$2$-dissimilarity vector}。给定一个正实数族$\{D_{i,j}\}_{i,j \in \{1,...,n\}}$,如果对任何$ i,j \in \{1,...,n\}$都有$\{1,...,n\} \subset V(T)$和$D_{i,j}({\cal T})=D_{i,j}$,我们说一个正加权树${\cal T}=(T,w)$实现了这个正实数族。正加权树的$2$ -相异度族的特征是已知的(参见\cite{B}、\cite{SimP}或\cite{St}):族必须满足众所周知的\emph{four-point condition}。然而,我们可以想知道,当存在一个正加权树与\emph{exactly} $n$顶点,$1,...,n,$和实现家庭$\{D_{i,j}\}$。在本文中,我们将证明四点条件是必要的,但不是更充分的,因此我们将引入两个额外的条件(见定理\ref{thm:ThmAgne})。

英文摘要:

Let ${\cal T}=(T,w)$ be a positive-weighted tree with at least $n$ vertices. For any $i,j \in \{1,...,n\}$, let $D_{i,j} ({\cal T})$ be the weight of the unique path in $T$ connecting $i$ and $j$. The $D_{i,j} ({\cal T})$ are called $2$-weights of ${\cal T}$ and, if we put in order the $2$-weights, the vector which has the $D_{i,j} ({\cal T})$ as components is called \emph{$2$-dissimilarity vector} of $ {\cal T}$. Given a family of positive real numbers $\{D_{i,j}\}_{i,j \in \{1,...,n\}}$, we say that a positive-weighted tree ${\cal T}=(T,w)$ realizes the family if $\{1,...,n\} \subset V(T)$ and $D_{i,j}({\cal T})=D_{i,j}$ for any $ i,j \in \{1,...,n\}$. A characterization of $2$-dissimilarity families of positive weighted trees is already known (see \cite{B}, \cite{SimP} or \cite{St}): the families must satisfy the well-known \emph{four-point condition}. However we can wonder when there exists a positive-weighted tree with \emph{exactly} $n$ vertices, $1,...,n,$ and realizing the family $\{D_{i,j}\}$. In this paper we will show that the four-point condition is necessary but no more sufficient, and so we will introduce two additional conditions (see Theorem \ref{thm:ThmAgne}).

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

↑