2026/02/06 by Raphaël Pagès · 1 voice
Computer Science · Mathematics · #cs.SC #math.RA
paper · pdf · doi:10.48550/arxiv.2602.07237
We present an algorithm to compute LCLM-decompositions for linear differentials operators with coefficients in the rational function field of characteristic p, \mathbbFpn(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 \mathbbFq(t)⟨∂⟩/\mathbbFq(t)⟨∂⟩ L^* and \mathbbFq(t)⟨∂⟩/\mathbbFq(t)⟨∂⟩ L, we find a corresponding LCLM-decomposition of L.