Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time
Symbolic Computation
2026-03-19 v3 Functional Analysis
Abstract
We design a fast algorithm that computes, for a given linear differential operator with coefficients in , all the characteristic polynomials of its p-curvatures, for all primes , 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.
Cite
@article{arxiv.2106.14637,
title = {Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time},
author = {Raphaël Pagès},
journal= {arXiv preprint arXiv:2106.14637},
year = {2026}
}