Contraction of Ore Ideals with Applications

11/25/2015
by   Yi Zhang, et al.
0

Ore operators form a common algebraic abstraction of linear ordinary differential and recurrence equations. Given an Ore operator L with polynomial coefficients in x, it generates a left ideal I in the Ore algebra over the field k(x) of rational functions. We present an algorithm for computing a basis of the contraction ideal of I in the Ore algebra over the ring R[x] of polynomials, where R may be either k or a domain with k as its fraction field. This algorithm is based on recent work on desingularization for Ore operators by Chen, Jaroschek, Kauers and Singer. Using a basis of the contraction ideal, we compute a completely desingularized operator for L whose leading coefficient not only has minimal degree in x but also has minimal content. Completely desingularized operators have interesting applications such as certifying integer sequences and checking special cases of a conjecture of Krattenthaler.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/20/2017

Univariate Contraction and Multivariate Desingularization of Ore Ideals

Ore operators with polynomial coefficients form a common algebraic abstr...
research
01/12/2018

Desingularization in the q-Weyl algebra

In this paper, we study the desingularization problem in the first q-Wey...
research
02/06/2021

Algorithms for Linearly Recurrent Sequences of Truncated Polynomials

Linear recurrent sequences are those whose elements are defined as linea...
research
08/25/2017

A Stabilized Normal Form Algorithm for Generic Systems of Polynomial Equations

We propose a numerical linear algebra based method to find the multiplic...
research
10/03/2019

D-Modules and Holonomic Functions

In algebraic geometry, one studies the solutions to polynomial equations...
research
11/28/2022

Tchebycheffian B-splines in isogeometric Galerkin methods

Tchebycheffian splines are smooth piecewise functions whose pieces are d...
research
03/17/2020

An Algorithm for Computing a Minimal Comprehensive Gröbner Basis of a Parametric Polynomial System

An algorithm to generate a minimal comprehensive Gröbner basis of a par...

Please sign up or login with your details

Forgot password? Click here to reset