MODNET
Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 1399

Preprint Number 1399

Previous Next Preprint server


1399. Mengxiao Sun
A New Bound on Hrushovski's Algorithm for Computing the Galois Group of a Linear Differential Equation
E-mail:

Submission date: 19 March 2018

Abstract:

The complexity of computing the Galois group of a linear differential equation is of general interest. In a recent work, Feng gave the first degree bound on Hrushovski's algorithm for computing the Galois group of a linear differential equation. This bound is the degree bound of the polynomials used in the first step of the algorithm for finding a proto-Galois group and is sextuply exponential in the order of the differential equation. In this paper, we use Szanto's algorithm of triangular representation for algebraic sets to analyze the complexity of computing the Galois group of a linear differential equation and we give a new bound which is triple exponential in the order of the given differential equation.

Mathematics Subject Classification:

Keywords and phrases:

Full text arXiv 1803.07105: pdf, ps.


Last updated: April 18 2018 07:08 Please send your corrections to: