A symplectic Kovacic's algorithm in dimension 4
Thierry Combot, Camilo Sanabria

TL;DR
This paper introduces an algorithm to identify and solve projectively symplectic fourth-order differential operators, leveraging Kovacic's algorithm and Klein's Theorem to find Liouvillian and algebraic solutions.
Contribution
It develops the first algorithm to test for projectively symplectic operators and compute their Liouvillian solutions in dimension four.
Findings
Algorithm successfully tests for projectively symplectic operators.
Computes Liouvillian solutions using Kovacic's algorithm.
Provides algebraic solutions as pullbacks of hypergeometric equations.
Abstract
Let be a th order differential operator with coefficients in , with a computable algebraically closed field. The operator is called symplectic when up to rational gauge transformation, the fundamental matrix of solutions satisfies where 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 is projectively symplectic. Furthermore, based on Kovacic's algorithm, we design an algorithm that computes Liouvillian solutions of projectively symplectic operators of order . Moreover, using Klein's Theorem, algebraic solutions are given as pullbacks of standard hypergeometric equations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
