Fast algorithms for differential equations in positive characteristic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2009

Fast algorithms for differential equations in positive characteristic

Alin Bostan
  • Function : Author
  • PersonId : 831654
Éric Schost
  • Function : Author
  • PersonId : 839026

Abstract

We address complexity issues for linear differential equations in characteristic~$p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to~$p$. We prove bounds linear in $p$ on the degree of polynomial solutions and propose algorithms for testing the existence of polynomial solutions in sublinear time $\tilde{O}(p^{1/2})$, and for determining a whole basis of the solution space in quasi-linear time $\tilde{O}(p)$; the $\tilde{O}$ notation indicates that we hide logarithmic factors. We show that for equations of arbitrary order, the $p$-curvature can be computed in subquadratic time $\tilde{O}(p^{1.79})$, and that this can be improved to $O(\log(p))$ for first order equations and to $\tilde{O}(p)$ for classes of second order equations.
Fichier principal
Vignette du fichier
BoSc09.pdf (221.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00355818 , version 1 (24-01-2009)

Identifiers

  • HAL Id : inria-00355818 , version 1
  • ARXIV : 0901.3843

Cite

Alin Bostan, Éric Schost. Fast algorithms for differential equations in positive characteristic. 2009. ⟨inria-00355818⟩

Collections

INRIA INRIA2 ANR
75 View
97 Download

Altmetric

Share

Gmail Facebook X LinkedIn More