arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.23928math.DSmath.COmath.NT
收藏

关于格点三角形的匮乏

On the paucity of lattice triangles

David Kurniadi Angdinata, Evan Chen, Ken Ono, Jesse Thorner, Jiaxin Zhang, Jujian Zhang

AI总结:

研究揭示在硬直角窗口中,通过算术方法证明除了密度为零的子集外,不存在格点三角形,核心方法利用Lean中的AxiomProver自动形式化。

摘要:

一个有理三角形T(其角度为π的有理数倍)展开为一个翻译表面(X_T,ω_T)。格点三角形问题要求分类那些使得(X_T,ω_T)为Veech(格点)表面的T,这意味着(X_T,ω_T)的SL_2(R)轨道在其层格中闭合(其在模空间上的投影为Teichmüller曲线)。最神秘的区域是“硬直角窗口”(最大角在(π/2,2π/3]),其中猜想不存在格点三角形。通过Mirzakhani-Wright秩障碍的算术重述,我们证明了一个定量定理,排除了该窗口中除了密度为零的子集外的所有三角形。本文的主要引擎由AxiomProver在Lean中自动形式化(使用mathlib)。

英文摘要:

A rational triangle $T$ (one whose angles are rational multiples of $π$) unfolds to a translation surface ${X_T}$. The lattice triangle problem asks to classify those $T$ for which ${X_T}$ is a Veech (lattice) surface, which means that the $\operatorname{SL}_2(\mathbb R)$-orbit of ${X_T}$ is closed in its stratum (so its projection to moduli space is a Teichmüller curve). The most mysterious regime is the "hard obtuse window" (largest angle in $(π/2,2π/3]$), where it is conjectured that no lattice triangles exist. Using an arithmetic reformulation of the Mirzakhani-Wright rank obstruction, we prove a quantitative theorem that rules out all but a proportion $n^{-1+o(1)}$ of the triangles in this window with denominator $n$. The main technical result in our proof was autoformalized by AxiomProver in Lean (using mathlib).

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

↑