跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2603.15437 · v2

Terminal Fano 4-fold Hypersurfaces via Deep Reinforcement Learning

首次提交 2026-03-16 23:42
版本更新 2026-11-03 19:00
雷达观测 2026-11-04 23:39
arXiv ↗PDF ↗

摘要

We construct $46{,}992$ new families of Fano $4$-fold hypersurfaces $X_d\subset\mathbb(a_1,\ldots,a_6)$ of Fano index $1$ with $d>200$, whose general members have terminal singularities. Unlike the $11{,}617$ quasismooth families classified by Brown and Kasprzyk, these are nonquasismooth, for which determining terminality can require the analysis of hyperquotient singularities. An exhaustive search has classified all nonquasismooth families with $d\leq200$, but extending this classification to higher degrees becomes computationally prohibitive. We therefore exploit the sparsity and spatial clustering of terminal examples using two best-first searches over $\mathbb{Z}^6$: one with a fixed heuristic, and the other with a neural network trained online by deep reinforcement learning. Together, the searches reach degrees up to $3{,}234$. The neural network additionally discovers an average of $79$ hard-to-reach families per run. For the most isolated examples, our conservative distance-based model gives an estimated lower bound of nearly $40\%$ of the fixed search's total step budget to discover a single such family. An ablation study demonstrates that this advantage arises from the neural network rather than stochastic exploration alone. The complete list of families is publicly available.

作者备注:12 pages, 11 figures, 5 tables. v2: Certified the terminality of the discovered families, added an ablation study, and revised the experimental results

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-03 19:00 · 最新观测版本

Terminal Fano 4-fold Hypersurfaces via Deep Reinforcement Learning

We construct $46{,}992$ new families of Fano $4$-fold hypersurfaces $X_d\subset\mathbb(a_1,\ldots,a_6)$ of Fano index $1$ with $d>200$, whose general members have terminal singularities. Unlike the $11{,}617$ quasismooth families classified by Brown and Kasprzyk, these are nonquasismooth, for which determining terminality can require the analysis of hyperquotient singularities. An exhaustive search has classified all nonquasismooth families with $d\leq200$, but extending this classification to higher degrees becomes computationally prohibitive. We therefore exploit the sparsity and spatial clustering of terminal examples using two best-first searches over $\mathbb{Z}^6$: one with a fixed heuristic, and the other with a neural network trained online by deep reinforcement learning. Together, the searches reach degrees up to $3{,}234$. The neural network additionally discovers an average of $79$ hard-to-reach families per run. For the most isolated examples, our conservative distance-based model gives an estimated lower bound of nearly $40\%$ of the fixed search's total step budget to discover a single such family. An ablation study demonstrates that this advantage arises from the neural network rather than stochastic exploration alone. The complete list of families is publicly available.

查看此版本解读 →查看此版本原文 ↗