Galois theory and algorithms for linear differential equations

DOI10.1016/j.jsc.2004.11.013zbMath1155.34004OpenAlexW1994973967MaRDI QIDQ2456554

Marius van der Put

Publication date: 19 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://pure.rug.nl/ws/files/2903840/2005JSymbCompvdPut.pdf

zbMATH Keywords

linear differential equationsdifferential Galois groupsdirect and inverse problemsdescent for differential equations

Mathematics Subject Classification ID

Linear ordinary differential equations and systems (34A30) Differential algebra (12H05) Algebraic aspects (differential-algebraic, hypertranscendence, group-theoretical) of ordinary differential equations in the complex domain (34M15)

Related Items (3)

A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence ⋮ A new bound on Hrushovski’s algorithm for computing the Galois group of a linear differential equation ⋮ Hrushovski's algorithm for computing the Galois group of a linear differential equation

Cites Work

• Arithmetic theory of \(q\)-difference equations. The \(q\)-analogue of Grothendieck-Katz's conjecture on \(p\)-curvatures
• Descent for differential modules and skew fields
• Computing the Galois group of a linear differential equation
• Unnamed Item

This page was built for publication: Galois theory and algorithms for linear differential equations