Hrushovski's Algorithm for Computing the Galois Group of a Linear Differential Equation
arXiv:1312.5029 · doi:10.1016/j.aam.2015.01.001
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.
27 pages
References in corpus (1)
Cited by in corpus (10)
- Calculating differential Galois groups of parametrized differential equations, with applications to hypertranscendence
- Computation of the difference-differential Galois group and differential relations among solutions for a second-order linear difference equation
- Computing the Lie algebra of the differential Galois group: the reducible case
- Liouville integrability: an effective Morales-Ramis-Simó theorem
- Reduced Forms of Linear Differential Systems and the Intrinsic Galois-Lie Algebra of Katz
- A New Bound on Hrushovski's Algorithm for Computing the Galois Group of a Linear Differential Equation
- Calculating Galois groups of third order linear differential equations with parameters
- Note on the construction of Picard-Vessiot rings for linear differential equations
- Linear Differential Systems with Small Coefficients: Various Types of Solvability and their Verification
- On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices