具有幂律长程跳跃的概周期算子的局域化：一种Nash-Moser迭代型可约化方法
Localization for Almost-Periodic Operators with Power-law Long-range Hopping: A Nash-Moser Iteration Type Reducibility Approach
AI总结：
该研究提出Nash-Moser迭代型可约化方法，证明带幂律长程跳跃的d维离散概周期算子的逆局域化，给出跳跃正则性定量下界，并将已有结果推广至幂律跳跃情形。
摘要：
本文提出一种Nash-Moser迭代型可约化方法，用于证明一类带幂律长程跳跃的d维离散概周期算子的（逆）局域化性质。本文还给出了跳跃正则性的定量下界。作为应用，将文献[Sar82, Pos83, Cra83, BLS83]中的部分结果推广到了幂律跳跃情形。
英文摘要：
In this paper we develop a Nash-Moser iteration type reducibility approach to prove the (inverse) localization for some $d$-dimensional discrete almost-periodic operators with power-law long-range hopping. We also provide a quantitative lower bound on the regularity of the hopping. As an application, some results of \cite{Sar82, Pos83, Cra83, BLS83} are generalized to the power-law hopping case.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
