arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2309.00784math.AP
收藏

Yamabe方程的最优风车划分

Optimal pinwheel partitions for the Yamabe equation

Mónica Clapp, Jorge Faya, Alberto Saldaña

AI总结:

本文通过构造具有线性等距群对称性的弱耦合竞争Yamabe系统,在耦合参数趋于负无穷时得到解的分离,从而证明了全空间中Yamabe方程最优风车划分的存在性,并利用对称性获得了无穷多个新的变号解。

摘要:

我们在全空间中建立了Yamabe方程最优划分的存在性,该划分由相互线性等距的集合组成,其中每个集合在一群线性等距变换的作用下保持不变。为此,我们建立了一个弱耦合竞争Yamabe系统解的存在性,该系统的各分量在群作用下保持不变,且每个分量都是通过将前一个分量与一个线性等距变换复合而得到的。我们证明,当耦合参数趋于负无穷时,解的各个分量发生分离,并产生具有上述性质的最优划分。最后,利用所考虑的对称性,我们建立了Yamabe方程无穷多个变号解的存在性,这些解不同于W.Y. Ding以及del Pino、Musso、Pacard和Pistoia先前发现的解。

英文摘要:

We establish the existence of an optimal partition for the Yamabe equation in the whole space made up of mutually linearly isometric sets, each of them invariant under the action of a group of linear isometries. To do this, we establish the existence of a solution to a weakly coupled competitive Yamabe system, whose components are invariant under the action of the group, and each of them is obtained from the previous one by composing it with a linear isometry. We show that, as the coupling parameter goes to minus infinity, the components of the solutions segregate and give rise to an optimal partition that has the properties mentioned above. Finally, taking advantage of the symmetries considered, we establish the existence of infinitely many sign-changing solutions for the Yamabe equation that are different from those previously found in the by W.Y. Ding, and del Pino, Musso, Pacard and Pistoia

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

↑