通过可整流的G电流重新审视Steiner树问题
The Steiner tree problem revisited through rectifiable G-currents
摘要:
斯坦纳树问题可以表述为找到一个包含给定的一组100个点的最小长度的连通集。我们将展示如何制定它作为一个质量最小化问题的$1$维电流系数在一个合适的赋范组。用于这些电流的表示允许陈述针对该问题的校准原理。我们还展示了一些例子中的校准。
英文摘要:
The Steiner tree problem can be stated in terms of finding a connected set of minimal length containing a given set of finitely many points. We show how to formulate it as a mass-minimization problem for $1$-dimensional currents with coefficients in a suitable normed group. The representation used for these currents allows to state a calibration principle for this problem. We also exhibit calibrations in some examples.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。