Related papers: Comprehensive Restriction Algorithm for Hypergeome…

In D-module theory, we have the notion of the restriction of a module along a smooth variety. T. Oaku and N. Takayama have described a process to compute the restriction, which starts from a free resolution adapted to the V-filtration of…

We describe algorithms for computing various functors for algebraic D-modules, i.e. systems of linear partial differential equations with polynomial coefficients. We will give algorithms for restriction, tensor product, localization, and…

We give an algorithm to compute inhomogeneous differential equations for definite integrals with parameters. The algorithm is based on the integration algorithm for $D$-modules by Oaku. Main tool in the algorithm is the Gr\"obner basis…

We present a method to compute the holonomic extension of a $D$-module from a Zariski open set in affine space to the whole space. A particular application is the localization of coherent $D$-modules which are holonomic on the complement of…

We undertake the study of bivariate Horn systems for generic parameters. We prove that these hypergeometric systems are holonomic, and we provide an explicit formula for their holonomic rank as well as bases of their spaces of complex…

We compute, by D-module restrictions, the slopes of irregular hypergeometric systems associated to a monomial curve.

This material introduces the D-Subspace algorithm derived on the basis of the centralized algorithm [1], which originally addresses parameter estimation problems under a subspace constraint.

We present a new algorithm for solving the reduction problem in the context of holonomic integrals, which in turn provides an approach to integration with parameters. Our method extends the Griffiths--Dwork reduction technique to holonomic…

The restriction problem is better understood for hypersurfaces and recent progresses have been made by bilinear and multilinear approaches and most recently polynomial partitioning method which is combined with those estimates. However, for…

We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…

An algorithm for the computation of global discrete conformal parametrizations with prescribed global holonomy signatures for triangle meshes was recently described in [Campen and Zorin 2017]. In this paper we provide a detailed analysis of…

In this paper, we prove a generalization of Green's Hyperplane Restriction Theorem to the case of modules over the polynomial ring, providing in particular an upper bound for the Hilbert function of the general linear restriction of a…

We study binomial D-modules, which generalize A-hypergeometric systems. We determine explicitly their singular loci and provide three characterizations of their holonomicity. The first of these states that a binomial D-module is holonomic…

We establish some cohomological bounds in D-module theory that are known in the holonomic case and folklore in general. The method rests on a generalization of the b-function lemma for non-holonomic D-modules.

Grothendieck local residue is considered in the context of symbolic computation. Based on the theory of holonomic D-modules, an effective method is proposed for computing Grothendieck local residues. The key is the notion of Noether…

This paper solves the global moduli problem for regular holonomic D-modules with normal crossing singularities on a nonsingular complex projective variety. This is done by introducing a level structure (which gives rise to…

Sets of bilinear constraints are important in various machine learning models. Mathematically, they are hyperbolas in a product space. In this paper, we give a complete formula for projections onto sets of bilinear constraints or hyperbolas…

We construct the limiting mixed Hodge structure of a degeneration of compact K\"ahler manifolds over the unit disk with a possibly non-reduced simple normal crossing singular central fiber via holonomic $\mathscr D$-modules, generalizing…

In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid. We show that their algorithm can be adapted to solve…

In this paper, we propose a second-order energy-conserving approximation procedure for Hamiltonian systems with holonomic constraints. The derivation of the procedure relies on the use of the so-called line integral framework. We provide…