Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time
Abstract
We design a fast algorithm that computes, for a given linear differential operator with coefficients in Z[x ], all the characteristic polynomials of its p-curvatures, for all primes p < N , in asymptotically quasi-linear bit complexity in N. We discuss implementations and applications of our algorithm. We shall see in particular that the good performances of our algorithm are quickly visible.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.