arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.04925cs.CGcs.DMmath.CO
收藏

具有多个非交叉匹配的点集

Point sets with many non-crossing matchings

Andrei Asinowski, Günter Rote

摘要:

平面上的一组$n$点可以具有的非交叉直线完美匹配的最大数目已知为$O(10.0438^n)$和$Ω^*(3^n)$。García、Noy和Tejel(2000)提出的下界是通过双链得到的,它具有$Θ(3^n n^{O(1)})$这样的匹配。我们重新证明这个界在一个简化的方式,使用新的概念下自由匹配,并将这种方法应用于其他几个建设。因此,我们改进了下界。首先证明了具有$n$点的双Z形链具有$Θ^*(λ^n)$,这样的匹配与$λ\approx 3.0532$。接下来,我们分析双锯齿链的进一步推广-双$r$ -链。参数的最佳选择导致具有$Θ^*(ν^n)$匹配的构造,具有$ν\approx 3.0930$。这个界限的推导需要分析两个无限向量之间的耦合动态规划递归。

英文摘要:

The maximum number of non-crossing straight-line perfect matchings that a set of $n$ points in the plane can have is known to be $O(10.0438^n)$ and $Ω^*(3^n)$. The lower bound, due to García, Noy, and Tejel (2000) is attained by the double chain, which has $Θ(3^n n^{O(1)})$ such matchings. We reprove this bound in a simplified way that uses the novel notion of down-free matching, and apply this approach on several other constructions. As a result, we improve the lower bound. First we show that double zigzag chain with $n$ points has $Θ^*(λ^n)$ such matchings with $λ\approx 3.0532$. Next we analyze further generalizations of double zigzag chains - double $r$-chains. The best choice of parameters leads to a construction with $Θ^*(ν^n)$ matchings, with $ν\approx 3.0930$. The derivation of this bound requires an analysis of a coupled dynamic-programming recursion between two infinite vectors.

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

↑