arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.5341cs.SC
收藏

p-曲率特征多项式的快速算法

A fast algorithm for computing the characteristic polynomial of the p-curvature

Alin Bostan, Xavier Caruso, Éric Schost

摘要:

讨论了特征$p$中微分算子的$p$ -曲率的理论和算法问题.给定这样一个算子$L$,并用$\Chi(L)$表示它的$p$ -曲率的特征多项式,我们首先证明了一个新的,可供选择的,对$\Chi(L)$的描述.这种描述特别适合于$p$较大时$\Chi(L)$的快速计算:基于此,我们设计了一种新的计算$\Chi(L)$的算法,其代价相对于$p$是地面场的$\softO(p^{0.5})$运算.这是显着的,因为在此之前,这项工作,最快的算法,这项任务,甚至决定幂零的$p$ -曲率的子任务,只有轻微的次二次复杂性$\softO(p^{1.79})$。

英文摘要:

We discuss theoretical and algorithmic questions related to the $p$-curvature of differential operators in characteristic $p$. Given such an operator $L$, and denoting by $\Chi(L)$ the characteristic polynomial of its $p$-curvature, we first prove a new, alternative, description of $\Chi(L)$. This description turns out to be particularly well suited to the fast computation of $\Chi(L)$ when $p$ is large: based on it, we design a new algorithm for computing $\Chi(L)$, whose cost with respect to $p$ is $\softO(p^{0.5})$ operations in the ground field. This is remarkable since, prior to this work, the fastest algorithms for this task, and even for the subtask of deciding nilpotency of the $p$-curvature, had merely slightly subquadratic complexity $\softO(p^{1.79})$.

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

↑