LCM decomposition of linear differential operators in positive characteristic
Abstract
We present an algorithm to compute LCLM-decompositions for linear differentials operators with coefficients in the rational function field of characteristic p, Fpn(t). We show that for an operator L of order r with coefficients of degree d, it finishes in polynomial time in r, d and p. This algorithm proceeds in three steps. We begin by showing that the ''shape'' of the factorisation of L can be easily obtained from the Frobenius normal form of its p-curvature, which can be efficiently computed an algorithm from Bostan, Caruso and Schost. Using results from the thesis of the author, we are then able to construct an operator L* in the same equivalence class as L for which an LCLM-decomposition is known. Finally, by computing an isomorphism between the quotient modules Fq(t)∂/Fq(t)∂ L* and Fq(t)∂/Fq(t)∂ L, we find a corresponding LCLM-decomposition of L.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.