Algorithmic proofs of two theorems of Stafford.

DOI10.1016/j.jsc.2004.07.003zbMath1130.16304arXivmath/0204303OpenAlexW2005759996MaRDI QIDQ2643577

Anton Leykin

Publication date: 24 August 2007

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

Full work available at URL: https://arxiv.org/abs/math/0204303

zbMATH Keywords

Weyl algebrasGröbner bases\(D\)-modulesminimal generation

Mathematics Subject Classification ID

Rings of differential operators (associative algebraic aspects) (16S32) Computational aspects of associative rings (general theory) (16Z05)

Related Items (8)

Recent progress in an algebraic analysis approach to linear systems ⋮ Computation of the expected Euler characteristic for the largest eigenvalue of a real non-central Wishart matrix ⋮ Restrictions of Pfaffian systems for Feynman integrals ⋮ Module structure of certain rings of differential operators ⋮ Serre's reduction of linear partial differential systems with holonomic adjoints ⋮ Exact linear modeling using Ore algebras ⋮ Computation of bases of free modules over the Weyl algebras. ⋮ A constructive study of the module structure of rings of partial differential operators.

Uses Software

• Macaulay2
• D-modules

Cites Work

• Unnamed Item
• Idéaux de germes d'opérateurs différentiels à une variable
• Algorithmic computation of local cohomology modules and the local cohomological dimension of algebraic varieties
• Module Structure of Weyl Algebras
• Towards an effective version of a theorem of Stafford

This page was built for publication: Algorithmic proofs of two theorems of Stafford.