arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2510.01352nlin.SImath-phmath.APmath.MP
收藏

非交换KP层级及其通过下降代数的求解

The noncommutative KP hierarchy and its solution via descent algebra

Lancaster University(兰卡斯特大学);Heriot-Watt University(赫瑞-瓦特大学)

Gordon Blower, Simon J. A. Malham

AI总结:

该研究通过含GLM方程的直接线性化给出完整非交换KP层级的解,结合Sato-Wilson装扮变换与Poppe首创的半加性散射数据方法,借助增广前Poppe代数与下降代数完成证明,凸显其构造性与组合结构价值。

摘要:

我们给出了完整非交换Kadomtsev–Petviashvili(KP,卡多姆采夫-彼得维谢夫利)层级的解。我们通过涉及Gelfand–Levitan–Marchenko(GLM,盖尔范德-列维坦-马尔琴科)方程的直接线性化实现这一目标。GLM方程是一类线性积分方程,其中散射数据满足线性化KP层级。我们随后证明GLM方程的解与非交换KP层级的解一致。我们采用两种方法完成证明:第一种方法使用标准的Sato-Wilson(佐藤-威尔逊)装扮变换;第二种方法由Poppe首创,我们假设散射数据是半可加的,通过直接代入证明GLM方程的解满足表征非交换KP层级的无穷多组场方程。该方法依赖于增广前Poppe代数,这是支撑该层级场方程的代表性代数,它是非结合的,且同构于配备嫁接乘积的下降代数。我们在非结合下降代数中完成计算,而确立完整层级解的最终结果存在于自然的结合子代数中。第二种方法的优势在于它具有构造性、显式性,凸显了层级内部的底层组合结构,并揭示了解的求解过程背后的机制。

英文摘要:

We give the solution to the complete noncommutative Kadomtsev--Petviashvili (KP) hierarchy. We achieve this via direct linearisation which involves the Gelfand--Levitan--Marchenko (GLM) equation. This is a linear integral equation in which the scattering data satisfies the linearised KP hierarchy. The solution to the GLM equation is then shown to coincide with the solution to the noncommutative KP hierarchy. We achieve this using two approaches. In the first approach we use the standard Sato-Wilson dressing transformation. In the second approach, which was pioneered by Poppe, we assume the scattering data is semi-additive and by direct substitution, we show that the solution to the GLM equation satisfies the infinite set of field equations representing the noncommutative KP hierarchy. This approach relies on the augmented pre-Poppe algebra. This is a representative algebra that underlies the field equations representing the hierarchy. It is nonassociative and isomorphic to a descent algebra equipped with a grafting product. While we perform computations in the nonassociative descent algebra, the final result which establishes the solution to the complete hierarchy, resides in the natural associative subalgebra. The advantages of this second approach are that it is constructive, explicit, highlights the underlying combinatorial structures within the hierarchy, and reveals the mechanisms underlying the solution procedure.

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

↑