arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.08119math.COcs.DM
收藏

交叉数与缠结交叉数的类比

Analogies between the crossing number and the tangle crossing number

Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz, Éva Czabarka, Giordano Da Lozzo, Natalie L. F. Hobson, Jephian C. -H. Lin, Austin Mohr, Heather C. Smith, Lász… 展开作者

Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz, Éva Czabarka, Giordano Da Lozzo, Natalie L. F. Hobson, Jephian C. -H. Lin, Austin Mohr, Heather C. Smith, László A. Székely, Hays Whitlatch

摘要:

Tanglegram是一种特殊的图,它由一对具有相同叶数的有根二叉树组成,并且两个叶集之间是完美匹配的。这些对象在遗传学中是有用的,并且用直线图表示,其中两个平面二叉树的叶子在两条平行线上,并且只有匹配的边缘可以交叉。缠结图的缠结交叉数是所有此类图的最小交叉数,并且与生物学相关的量有关,例如寄生虫转换宿主的次数。我们的主要结果tanglegram平行已知定理交叉数如下。在具有$n$叶的缠结图中移除单个匹配边会使缠结交叉数最多减少$n-3$,并且这是尖锐的。另外,如果$γ(n)$是一个有$n$叶子的缠结图的最大缠结交叉数,我们证明了$\frac{1}{2}\binom{n}{2}(1-o(1))\leγ(n)<\frac{1}{2}\binom{n}{2}$。此外,我们提供了一个算法,计算非平凡的下界上的纠缠交叉数在$O(n^4)$时间。这个下界可能很紧,即使对于具有缠结交叉数$Θ(n^2)$的缠结图也是如此。

英文摘要:

Tanglegrams are special graphs that consist of a pair of rooted binary trees with the same number of leaves, and a perfect matching between the two leaf-sets. These objects are of use in phylogenetics and are represented with straightline drawings where the leaves of the two plane binary trees are on two parallel lines and only the matching edges can cross. The tangle crossing number of a tanglegram is the minimum crossing number over all such drawings and is related to biologically relevant quantities, such as the number of times a parasite switched hosts. Our main results for tanglegrams which parallel known theorems for crossing numbers are as follows. The removal of a single matching edge in a tanglegram with $n$ leaves decreases the tangle crossing number by at most $n-3$, and this is sharp. Additionally, if $γ(n)$ is the maximum tangle crossing number of a tanglegram with $n$ leaves, we prove $\frac{1}{2}\binom{n}{2}(1-o(1))\leγ(n)<\frac{1}{2}\binom{n}{2}$. Further, we provide an algorithm for computing non-trivial lower bounds on the tangle crossing number in $O(n^4)$ time. This lower bound may be tight, even for tanglegrams with tangle crossing number $Θ(n^2)$.

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

↑