Desingularization in the q-Weyl algebra

01/12/2018
by   Christoph Koutschan, et al.
0

In this paper, we study the desingularization problem in the first q-Weyl algebra. We give an order bound for desingularized operators, and thus derive an algorithm for computing desingularized operators in the first q-Weyl algebra. Moreover, an algorithm is presented for computing a generating set of the first q-Weyl closure of a given q-difference operator. As an application, we certify that several instances of the colored Jones polynomial are Laurent polynomial sequences by computing the corresponding desingularized operator.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/02/2018

Weihrauch goes Brouwerian

We prove that the Weihrauch lattice can be transformed into a Brouwer al...
research
04/11/2021

The algebraic structure of the densification and the sparsification tasks for CSPs

The tractability of certain CSPs for dense or sparse instances is known ...
research
11/25/2015

Contraction of Ore Ideals with Applications

Ore operators form a common algebraic abstraction of linear ordinary dif...
research
02/27/2022

New efficient algorithms for computing Gröbner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon)

This paper is concerned with linear algebra based methods for solving ex...
research
02/17/2022

Desingularization and p-Curvature of Recurrence Operators

Linear recurrence operators in characteristic p are classified by their ...
research
02/25/2020

Failure Trace Semantics for a Process Algebra with Time-outs (preliminary report)

This paper extends a standard process algebra with a time-out operator, ...
research
08/26/2021

Minimal Stinespring Representations of Operator Valued Multilinear Maps

A completely positive linear map φ from a C*-algebra A into B(H) has a S...

Please sign up or login with your details

Forgot password? Click here to reset