Factorization of differential systems in characteristic p
@inproceedings{Cluzeau2003FactorizationOD, title={Factorization of differential systems in characteristic p}, author={T. Cluzeau}, booktitle={ISSAC '03}, year={2003} }
We present an algorithm for factoring differential systems with coefficients in <b>F</b><inf><i>p</i></inf>(<i>z</i>). Such an algorithm has already been given by van der Put in [20], [24, 13.1] and [22]. We recast his ideas to handle systems directly and we add some comparisons of strategies, an implementation in Maple<sup>1</sup> and a complexity analysis. The central tool for factoring in characteristic <i>p</i> is the <i>p</i> curvature. We prove the links between the <i>p</i>-curvature and… Expand
Topics from this paper
29 Citations
Fast algorithms for differential equations in positive characteristic
- Mathematics, Computer Science
- ISSAC '09
- 2009
- 16
- PDF
A fast algorithm for computing the characteristic polynomial of the p-curvature
- Mathematics, Computer Science
- ISSAC
- 2014
- 10
- PDF
On the Moser- and super-reduction algorithms of systems of linear differential equations and their complexity
- Computer Science, Mathematics
- J. Symb. Comput.
- 2009
- 37
References
SHOWING 1-3 OF 3 REFERENCES
Complexity of irreducibility testing for a system of linear ordinary differential equations
- Mathematics, Computer Science
- ISSAC '90
- 1990
- 21
- Highly Influential
- PDF
Modular methods for factoring differential operators
- Unpublished manuscript (Preliminary Version),
- 1997
Modular methods for factoring differential operators. Unpublished manuscript (Preliminary Version)
- Modular methods for factoring differential operators. Unpublished manuscript (Preliminary Version)
- 1997