Fast algorithms for differential equations in positive characteristic
From MaRDI portal
Recommendations
- A fast algorithm for computing the p-curvature
- A fast algorithm for computing the characteristic polynomial of the \(p\)-curvature
- Fast algorithms for polynomial solutions of linear differential equations
- Computation of the Similarity Class of the p-Curvature
- scientific article; zbMATH DE number 2151182
Cited in
(12)- Enumeration and asymptotics of restricted compositions having the same number of parts
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
- A fast algorithm for computing the p-curvature
- On p-adic differential equations with separation of variables
- A fast algorithm for computing the characteristic polynomial of the \(p\)-curvature
- scientific article; zbMATH DE number 2151182 (Why is no real title available?)
- Intrinsic approach to Galois theory of q-difference equations
- An algorithm for constructing certain differential operators in positive characteristic
- Products of ordinary differential operators by evaluation and interpolation
- Factoring partial differential systems in positive characteristic. With an appendix by M. van der Put: Classification of partial differential modules in positive characteristic
- Factoring differential operators over algebraic curves in positive characteristic
- Algebraic solutions of linear differential equations: an arithmetic approach
This page was built for publication: Fast algorithms for differential equations in positive characteristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883799)
