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

TL;DR

This paper introduces a new, efficient algorithm for computing the characteristic polynomial of the p-curvature of differential operators in characteristic p, significantly improving computational complexity for large p.

Contribution

It provides a novel description of the characteristic polynomial of the p-curvature and develops a fast algorithm with complexity O(p^{0.5}) for its computation.

Findings

New description of hi(L) suitable for fast computation

Algorithm achieves O(p^{0.5}) complexity, faster than previous methods

Enables efficient decision of nilpotency of p-curvature

Abstract

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})$.