Work

Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time

Year: 2021

Type: conference-paper

Abstract: We design a fast algorithm that computes, for a given linear differential operator with coefficients in 918;[x], all the characteristic polynomials of its p-curvatures, for all primes p < N, in asymptoti- cally 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.

Source: International Symposium on Symbolic and Algebraic Computation

DOI: 10.1145/3452143.3465524

Author: Raphaël Pagès

Institution: Université de Bordeaux

Language: English

Topic: Polynomial and algebraic computation

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Agence Nationale de la Recherche

Awards: The p-adic Langlands correspondence: a constructive and algorithmic approach, Deciding irrationality and transcendence