arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.05181math.OC
收藏

在$N-$维欧几里得空间中检测Frechet $N-$多重单形的加权Fermat-Steiner-Frechet多重树的拉格朗日程序

A Lagrangian program detecting the Weighted Fermat-Steiner-Frechet multitree for a Frechet $N-$multisimplex in the $N-$dimensional Euclidean Space

Anastasios N. Zachos

摘要:

在本文中,我们引入了一个正实数$\frac{N(N+1)}{2}-$元组的Fermat-Steiner-Frechet问题,它决定了$\mathbb{R}^{N},$中$N-$单形的边长,从而研究了它的解,称为“Fermat-Steiner-Frechet多树”,它由Blumenthal意义下所有导出的两两不全等$N-$单形的Fermat-Steiner树的并集组成,Herzog对$N=3$和Dekster-Wilker对$N\ge 3.$我们基于Lagrange乘子理论得到了一种确定$\mathbb{R}^{N}$中Fermat-Steiner-Frechet多重树的方法,其等式约束依赖于$\mathbb{R}^{N}.$中$N-$单形的逆加权Fermat问题的$N-1$独立解用于$\mathbb{R}^{N}$中的Fermat-SteinerFrechet问题的拉格朗日程序的应用是检测具有全局最小长度的Fermat-Steiner树,所述Fermat-Steiner树具有由Dekster-Wilker控制的连续自然数的$\frac{N(N+1)}{2}-$元组确定的$\frac{[\frac{N(N+1)}{2}]!}{(N+1)!}$不一致的$N-$单形中的$\frac{N(N+1)}{2}-$相等加权的Fermat-Steiner点,Blumenthal-Herzog条件,并丰富了自然界的基本进化过程(最小通信网络,最小质量转移,不一致单形的最大体积)。此外,我们还利用$\mathbb{R}^{N}.$中$N-$边界单形顶点对应的唯一$(N+1)$权集,得到了加权Fermat反问题的唯一解

英文摘要:

In this paper, we introduce the Fermat-Steiner-Frechet problem for a given $\frac{N(N+1)}{2}-$tuple of positive real numbers determining the edge lengths of an $N-$simplex in $\mathbb{R}^{N},$ in order to study its solution called the "Fermat-Steiner-Frechet multitree," which consist of a union of Fermat-Steiner trees for all derived pairwise incongruent $N-$simplexes in the sense of Blumenthal, Herzog for $N=3$ and Dekster-Wilker for $N\ge 3.$ We obtain a method to determine the Fermat-Steiner Frechet multitree in $\mathbb{R}^{N}$ based on the theory of Lagrange multipliers, whose equality constraints depend on $N-1$ independent solutions of the inverse weighted Fermat problem for an $N-$simplex in $\mathbb{R}^{N}.$ A fundamental application of the Lagrangian program for the Fermat-Steiner Frechet problem in $\mathbb{R}^{N}$ is the detection of the Fermat-Steiner tree with global minimum length having $N-1$ equally weighted Fermat-Steiner points among $\frac{[\frac{N(N+1)}{2}]!}{(N+1)!}$ incongruent $N-$simplexes determined by an $\frac{N(N+1)}{2}-$tuple of consecutive natural numbers controlled by Dekster-Wilker, Blumenthal-Herzog conditions and enriched with the fundamental evolutionary processes of Nature (Minimum communication networks, minimum mass trasfer, maximum volume of incongruent simplexes). Furthermore, we obtain the unique solution of the inverse weighted Fermat problem, referring to the unique set of $(N+1)$ weights, which correspond to the vertices of an $N-$ boundary simplex in $\mathbb{R}^{N}.$

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

↑