We present an algorithm to compute -decompositions for linear differentials operators with coefficients in the rational function field of characteristic , . We show that for an operator of order with coefficients of degree , it finishes in polynomial time in , and . This algorithm proceeds in three steps. We begin by showing that the ‘‘shape’’ of the factorisation of can be easily obtained from the Frobenius normal form of its -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 in the same equivalence class as for which an -decomposition is known. Finally, by computing an isomorphism between the quotient modules and , we find a corresponding -decomposition of .

生成讲解博客的中文版本

生成AI智能校验的中文版本