Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2106.14637 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911523480272896 |
|---|---|
| author | Pagès, Raphaël |
| author_facet | Pagès, Raphaël |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2106_14637 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time Pagès, Raphaël Symbolic Computation Functional Analysis 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. |
| title | Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time |
| topic | Symbolic Computation Functional Analysis |
| url | https://arxiv.org/abs/2106.14637 |