1 research outputs found

    A Symplectic Kovacic's Algorithm in Dimension 4

    No full text
    International audienceLet L be a 4th order linear differential operator with coefficients in K(z), with K a computable algebraically closed field. The operator L is called symplectic when up to rational gauge transformation, the fundamental matrix of solutions X satisfies Xt J X=J where J is the standard symplectic matrix. It is called projectively symplectic when it is projectively equivalent to a symplectic operator. We design an algorithm to test if L is projectively symplectic. Furthermore, based on Kovacic's algorithm, we design an algorithm that computes Liouvillian solutions of projectively symplectic operators of order 4. Moreover, using Klein's Theorem, algebraic solutions are given as pullbacks of standard hypergeometric equations
    corecore