Comprehensive Restriction Algorithm for Hypergeometric Systems

2025/09/05 by Hiromasa Nakayama, Nakayama, Hiromasa, Nobuki Takayama +1
Engineering · Mathematics · #33C70 (Primary) 14F10 (Secondary) #Advanced Numerical Analysis Techniques #Algebraic Geometry (math.AG) #Commutative Algebra (math.AC) #FOS: Computer and information sciences #FOS: Mathematics #Numerical methods for differential equations #Simulation and Modeling Applications #Symbolic Computation (cs.SC)

paper · pdf · doi:10.48550/arxiv.2510.05104

openalex publication_date 2025/09/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

An algorithm computing the restriction of a holonomic D-module to a linear subspace was given by T.Oaku in 1997. We consider a problem of computing the restriction for a given holonomic D-module with parameters. We will give a partial answer to the problem for general holonomic D-modules and an answer to hypergeometric holonomic D-modules.

Citations

• Torus equivariant D-modules and hypergeometric systems
• Isomorphism classes of A-hypergeometric systems

Related

• Bivariate hypergeometric D-modules
• Green's Hyperplane Restriction Theorem: an extension to modules
• Singularities and holonomicity of binomial D-modules
• D-Modules and Holonomic Functions
• Isomorphism classes of A-hypergeometric systems