关于$\mathbb{R}^2$中极小划分和极小网络的不同标定概念
On different notions of calibrations for minimal partitions and minimal networks in $\mathbb{R}^2$
摘要:
校准是一种可能的工具,以验证某一候选的最小值。他们已被引入的背景下,极小曲面和适应的情况下,施泰纳问题的几个变种。我们的目标是比较不同的概念校准的施泰纳问题和平面最小分区。然后补充说明的凸化的问题,不存在的校准和校准的家庭。
英文摘要:
Calibrations are a possible tool to validate the minimality of a certain candidate. They have been introduced in the context of minimal surfaces and adapted to the case of Steiner problem in several variants. Our goal is to compare the different notions of calibrations for the Steiner Problem and for planar minimal partitions. The paper is then complemented with remarks on the convexification of the problem, on non-existence of calibrations and on calibrations in families.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。