Linear differential equations with finite differential Galois group
M. van der Put, C. Sanabria Malag\'on, J. Top

TL;DR
This paper develops an algorithmic approach to reconstruct linear differential operators with finite Galois groups from evaluations, advancing inverse Galois problems and invariant theory in differential equations.
Contribution
It introduces a method to compute differential operators from evaluations using a theorem by Compoint, complementing existing algorithms and addressing inverse problems for finite Galois groups.
Findings
Algorithm for reconstructing operators from evaluations
Construction of G-invariant curves with genus zero quotients
Illustrative examples connecting to classical work
Abstract
For a differential operator of order over with a finite (differential) Galois group , there is an algorithm, by M. van Hoeij and J.-A.~Weil, which computes the associated evaluation of the invariants . The procedure proposed here does the opposite: it uses a theorem of E.~Compoint and computes the operator from a given evaluation . Moreover it solves a part of the inverse problem of producing for a given representation of a finite group . Another part considered here, is finding irreducible -invariant curves with of genus zero and constructing evaluations from this. The theory developed here is illustrated by various examples, and relates to and continues classical work of H.A.~Schwarz, G.~Fano, F.~Klein and A.~Hurwitz.
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.
Taxonomy
TopicsPolynomial and algebraic computation · Algebraic Geometry and Number Theory · Advanced Numerical Analysis Techniques
