关于谱极小划分 II:矩形情形
On spectral minimal partitions II, the case of the rectangle
AI总结:
本文研究矩形区域上谱极小3-划分问题,分析了当边长比超过临界值√(3/8)时,从节点划分到非节点划分的转变机制,并利用Aharonov-Bohm哈密顿量或双覆盖方法解决等谱问题。
摘要:
延续\cite{HHOT}的工作,我们讨论矩形$]- rac a2, rac a2[ imes ] - rac b2, rac b2[ $(其中$0< a\leq b$)上的谱极小3-划分问题。在\cite{HHOT}中已经观察到,当$0< rac ab < \sqrt{ rac 38}$时,极小3-划分由第三本征函数的三个节点区域给出,对应三个矩形$]- rac a2, rac a2[ imes ] - rac b2,- rac b6[$、$]- rac a2, rac a2[ imes ] - rac b6, rac b6[$和$]- rac a2, rac a2[ imes ] rac b6, rac b2[$。我们将描述当$ rac ab$增加时,在值$\sqrt{ rac 38}$处这些节点极小3-划分与非节点极小3-划分之间可能的转变机制,并讨论当$\sqrt{ rac 38}< rac ab \leq 1$时,存在对称候选者给出极小3-划分的可能性。数值分析自然地引出了关于等谱性的有趣问题,这些问题通过引入Aharonov-Bohm哈密顿量或考虑穿孔矩形的双覆盖来解决。
英文摘要:
In continuation of \cite{HHOT}, we discuss the question of spectral minimal 3-partitions for the rectangle $]-\frac a2,\frac a2[\times ] -\frac b2,\frac b2[ $, with $0< a\leq b$. It has been observed in \cite{HHOT} that when $0<\frac ab < \sqrt{\frac 38}$ the minimal 3-partition is obtained by the three nodal domains of the third eigenfunction corresponding to the three rectangles $]-\frac a2,\frac a2[\times ] -\frac b2,-\frac b6[$, $]-\frac a2,\frac a2[\times ] -\frac b6,\frac b6[$ and $]-\frac a2,\frac a2[\times ] \frac b6, \frac b2[$. We will describe a possible mechanism of transition for increasing $\frac ab$ between these nodal minimal 3-partitions and non nodal minimal 3-partitions at the value $ \sqrt{\frac 38}$ and discuss the existence of symmetric candidates for giving minimal 3-partitions when $ \sqrt{\frac 38}<\frac ab \leq 1$. Numerical analysis leads very naturally to nice questions of isospectrality which are solved by introducing Aharonov-Bohm Hamiltonians or by going on the double covering of the punctured rectangle.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。