Desingularization in the $q$-Weyl algebra
Symbolic Computation
2018-03-12 v2
Abstract
In this paper, we study the desingularization problem in the first -Weyl algebra. We give an order bound for desingularized operators, and thus derive an algorithm for computing desingularized operators in the first -Weyl algebra. Moreover, an algorithm is presented for computing a generating set of the first -Weyl closure of a given -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.
Cite
@article{arxiv.1801.04160,
title = {Desingularization in the $q$-Weyl algebra},
author = {Christoph Koutschan and Yi Zhang},
journal= {arXiv preprint arXiv:1801.04160},
year = {2018}
}