Hrushovski's Algorithm for Computing the Galois Group of a Linear Differential Equation
Author:
Preprint
Abstract
We present a detailed and simplified version of Hrushovski's algorithm that determines the Galois group of a linear differential equation. There are three major ingredients in this algorithm. The first is to look for a degree bound for proto-Galois groups, which enables one to compute one of them. The second is to determine the identity component of the Galois group that is the pullback of a torus to the proto-Galois group. The third is to recover the Galois group from its identity component and a finite Galois group.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Galois Theory of Linear Differential Equations2003
- Computing the Galois group of a linear differential equation2002
- Computing Galois Groups of Completely Reducible Differential EquationsJournal of Symbolic Computation, 1999
- An algorithm for computing invariants of differential Galois groupsJournal of Pure and Applied Algebra, 1997
- Elementary and Liouvillian Solutions of Linear Differential EquationsJournal of Symbolic Computation, 1986
- An algorithm for solving second order linear homogeneous differential equationsJournal of Symbolic Computation, 1986