42digest首页
极小水平triods:分析与计算

Minimal horizontal triods: Analysis and computation

Robert Nürnberg and Paola Pozzi

arXiv
2025年7月21日

本文研究了在Heisenberg群中连接三个给定点的极小长度网络配置问题。在证明了(可能退化的)极小水平triods的存在性后,我们研究了它们的特征刻画。随后,我们提出了一种水平曲线缩短流,可将任何合适的初始triod变形为长度泛函的临界点。基于稳定的全离散有限元格式的数值实验,为我们提供了对这一亚黎曼几何丰富景观的有益见解。

In this article we investigate the question of finding a network configuration of minimal length connecting three given points in the Heisenberg group. After proving existence of (possibly degenerate) minimal horizontal triods, we investigate their characterization. We then formulate a horizontal curve shortening flow that deforms any given suitable initial triod into a critical point for the length functional. Numerical experiments based on a stable fully discrete finite element scheme provide ...