arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1205.5779math.COcs.DMcs.DS
收藏

多态特征相容性的改进下界

Improved Lower Bounds on the Compatibility of Multi-State Characters

Brad Shutters, Sudheer Vakati, David Fernández-Baca

摘要:

我们研究了一个长期存在的猜想的必要条件和充分条件的兼容性的多状态字符:存在一个功能$f(r)$,使得任何一组$C$的$r$状态字符,$C$是兼容的当且仅当每个子集的$f(r)$的$C$字符是兼容的。我们证明了对于每个$r \ge 2$,存在一个$\lfloor\frac{r}{2}\rfloor\cdot\lceil\frac{r}{2}\rceil + 1$ $r$ -状态特征的不相容集$C$,使得$C$的每个真子集都是相容的.因此,每个$r \ge 2$都有$f(r) \ge \lfloor\frac{r}{2}\rfloor\cdot\lceil\frac{r}{2}\rceil + 1$。这改进了Meacham(1983)给出的$f(r) \ge r$的先前下界,并且推广了Habib和To(2011)给出的证明$f(4) \ge 5$的构造。我们证明了我们的结果,通过一个结果四元组兼容性,可能是独立的利益:对于每一个整数$n \ge 4$,存在一个不兼容的集$Q$的$\lfloor\frac{n-2}{2}\rfloor\cdot\lceil\frac{n-2}{2}\rceil + 1$四元组$n$标签,使每个真子集的$Q$是兼容的。我们对比这一结果的兼容性的三元组:对于每一个$n \ge 3$,如果$R$是一个不兼容的一组以上的$n-1$三元组的$n$标签,那么一些真子集的$R$是不兼容的。我们展示了这个上限是紧的,为每一个$n \ge 3$,一组$n-1$三联体的$n$类群,$R$是不兼容的,但每一个真子集的$R$是兼容的。

英文摘要:

We study a long standing conjecture on the necessary and sufficient conditions for the compatibility of multi-state characters: There exists a function $f(r)$ such that, for any set $C$ of $r$-state characters, $C$ is compatible if and only if every subset of $f(r)$ characters of $C$ is compatible. We show that for every $r \ge 2$, there exists an incompatible set $C$ of $\lfloor\frac{r}{2}\rfloor\cdot\lceil\frac{r}{2}\rceil + 1$ $r$-state characters such that every proper subset of $C$ is compatible. Thus, $f(r) \ge \lfloor\frac{r}{2}\rfloor\cdot\lceil\frac{r}{2}\rceil + 1$ for every $r \ge 2$. This improves the previous lower bound of $f(r) \ge r$ given by Meacham (1983), and generalizes the construction showing that $f(4) \ge 5$ given by Habib and To (2011). We prove our result via a result on quartet compatibility that may be of independent interest: For every integer $n \ge 4$, there exists an incompatible set $Q$ of $\lfloor\frac{n-2}{2}\rfloor\cdot\lceil\frac{n-2}{2}\rceil + 1$ quartets over $n$ labels such that every proper subset of $Q$ is compatible. We contrast this with a result on the compatibility of triplets: For every $n \ge 3$, if $R$ is an incompatible set of more than $n-1$ triplets over $n$ labels, then some proper subset of $R$ is incompatible. We show this upper bound is tight by exhibiting, for every $n \ge 3$, a set of $n-1$ triplets over $n$ taxa such that $R$ is incompatible, but every proper subset of $R$ is compatible.

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

↑