跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1680新增论文
+1333其中 AI 相关
+187已有论文修订
+59新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-17 23:35各信源进度 →

统计口径与数据新鲜度

统计 2026-11-17 05:28 — 2026-11-18 05:28(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-17 23:35库内论文最新更新时间:2026-11-17 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

25,786 已收录论文21,491 AI 相关7,725 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
版本更新 · v4arXiv:2504.21058

Theta结构的对称兼容性及其在层级变换与同源中的应用

Symmetric compatibility of theta structures, with applications to change of level and isogenies

Antoine Dequay, David Lubicz

AI 速读 基于摘要

研究theta结构的对称兼容性,将Mumford兼容对推广到任意d,并用于层级变换和同源算法。

cs.SC · math.NT

查看原文摘要

Let $m,n,d >1$ be integers such that $n=md$ and let $(B, \mathscr{M}, Θ\_{\mathscr{M}})$ be a marked abelian variety of level $m$ over a field of odd characteristic. We study the theta structures of level $n$ for $\mathscr{M}^d$, and the theta structures on the abelian varieties $d$-isogenous to $B$, which are compatible with $Θ\_{\mathscr{M}}$. When $d$ is odd and coprime to $m$, they correspond to the isotropic subgroups of $B[n]$, and this correspondence underlies the known algorithms in theta coordinates. In general, this is no longer true. We introduce the notion of symmetric compatibility of a torsion point with a symmetric level subgroup, and we show that a subgroup of $B[n]$ isomorphic to $(\mathbb{Z}/n\mathbb{Z})^g$ comes from a compatible theta structure if and only if it is isotropic and all its points are symmetric compatible. We extend to every $d$ Mumford's notion of compatible pairs of theta structures, defined by Mumford for $d=2$, and prove that it is equivalent to our notion, which can be tested on theta coordinates; we also describe exactly the remaining ambiguity, which explains the sign choices met when the duplication formula is used to change the level. As applications, we obtain change of level and isogeny algorithms without assuming that $d$ is odd and coprime to $m$, using $O(n^{3g} \log(d))$ and $O(n^{2g} \log(d))$ operations in the base field respectively. In particular, they give change of level algorithms for even $d$, and $2$-isogenies in level $4$ theta coordinates with an explicit control of the theta structure of the codomain.