一种计算p-曲率的快速算法
A Fast Algorithm for Computing the p-Curvature
摘要:
设计了一个计算正特征微分系统$p$的$p$ -曲率的算法.对于度系数至多为$d$的维数$r$的系统,其复杂度为基域中的$\softO (p d r^ω)$运算(其中$ω$表示矩阵乘法的指数),而输出的大小约为$p d r^2$。假设矩阵乘法为(\emph{i.e.} $ω= 2$),则我们的算法是准最优的。我们使用的主要理论输入是存在一个非常适合的环系列与划分的权力,一个类似的柯西-Lipschitz定理举行。
英文摘要:
We design an algorithm for computing the $p$-curvature of a differential system in positive characteristic $p$. For a system of dimension $r$ with coefficients of degree at most $d$, its complexity is $\softO (p d r^ω)$ operations in the ground field (where $ω$ denotes the exponent of matrix multiplication), whereas the size of the output is about $p d r^2$. Our algorithm is then quasi-optimal assuming that matrix multiplication is (\emph{i.e.} $ω= 2$). The main theoretical input we are using is the existence of a well-suited ring of series with divided powers for which an analogue of the Cauchy--Lipschitz Theorem holds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。