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

平面凸码是可判定的

Planar convex codes are decidable

Boris Bukh, R. Amzi Jeffs

摘要:

我们证明了平面上的每一个可由紧集实现的凸码都有一个由多边形构成的实现,类似地,平面上的每一个开凸码都可以由多边形的内部实现。我们给阶乘类型的界限,需要形成这样的实现的顶点数。因此,我们表明,有一个算法来决定是否凸码承认一个封闭或开放的实现在平面上。

英文摘要:

We show that every convex code realizable by compact sets in the plane admits a realization consisting of polygons, and analogously every open convex code in the plane can be realized by interiors of polygons. We give factorial-type bounds on the number of vertices needed to form such realizations. Consequently we show that there is an algorithm to decide whether a convex code admits a closed or open realization in the plane.

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

↑