在covering space设置中校准最小网络
Calibrations for minimal networks in a covering space setting
摘要:
在本文中,我们定义了一个等价的方法,经典的Steiner问题的覆盖空间设置的校准的概念,我们给出了一些明确的例子。此外,我们引入了家庭校准的概念:我们的想法是以适当的方式划分竞争对手的集合,定义一个适当的(和较弱的)校准概念。然后,校准每个家庭中的候选极小点,并比较它们的周长,它是可能的,找到最小化问题的极小点。由于这个过程中,我们证明了极小的施泰纳配置跨越顶点的正六边形和正五边形。
英文摘要:
In this paper we define a notion of calibration for an equivalent approach to the classical Steiner problem in a covering space setting and we give some explicit examples. Moreover we introduce the notion of calibration in families: the idea is to divide the set of competitors in a suitable way, defining an appropriate (and weaker) notion of calibration. Then, calibrating the candidate minimizers in each family and comparing their perimeter, it is possible to find the minimizers of the minimization problem. Thanks to this procedure we prove the minimality of the Steiner configurations spanning the vertices of a regular hexagon and of a regular pentagon.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。