arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0705.1903nlin.SI
收藏

利用因式分解寻找可积格映射

Searching for integrable lattice maps using factorization

Jarmo Hietarinta, Claude Viallet

摘要:

我们分析格映射的因式分解过程,寻找可积的情况。假设映射在因变量中至多是二次的,并且在2步迭代之后,我们需要最小的因子分解(一个线性因子)。然后使用代数熵对结果进行分类。发现了一些新的多项式增长(与可积性强相关)模型,其中之一是与KdV(修正的和Schwarzian)相关的齐次二次映射的非对称推广,并证明了该模型的“围绕立方体的相容性”。

英文摘要:

We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of iteration. The results were then classified using algebraic entropy. Some new models with polynomial growth (strongly associated with integrability) were found. One of them is a nonsymmetric generalization of the homogeneous quadratic maps associated with KdV (modified and Schwarzian), for this new model we have also verified the "consistency around a cube".

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

↑