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

多面体覆盖半径的计算及其在孤独奔跑者中的应用

Computing the covering radius of a polytope with an application to lonely runners

Jana Cslovjecsek, Romanos Diogenes Malikiosis, Márton Naszódi, Matthias Schymura

摘要:

本文讨论了确定有理多胞形覆盖半径的计算问题。该参数被定义为使相应膨胀的多面体的晶格平移以覆盖整个空间所需的最小膨胀因子。作为我们的主要结果,我们描述了一个新的算法,这是简单的,更有效的,更容易实现比Kannan(1992)的唯一的现有算法。出于著名的孤独的跑步者猜想的一个变种,我们使用它的几何解释的覆盖半径zonotopes,并应用我们的算法来证明第一个开放的情况下,三个跑步者与个人的起点。

英文摘要:

We are concerned with the computational problem of determining the covering radius of a rational polytope. This parameter is defined as the minimal dilation factor that is needed for the lattice translates of the correspondingly dilated polytope to cover the whole space. As our main result, we describe a new algorithm for this problem, which is simpler, more efficient and easier to implement than the only prior algorithm of Kannan (1992). Motivated by a variant of the famous Lonely Runner Conjecture, we use its geometric interpretation in terms of covering radii of zonotopes, and apply our algorithm to prove the first open case of three runners with individual starting points.

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

↑