Resultant-based Elimination in Ore Algebra
Symbolic Computation
2022-10-10 v3
Abstract
We consider resultant-based methods for elimination of indeterminates of Ore polynomial systems in Ore algebra. We start with defining the concept of resultant for bivariate Ore polynomials then compute it by the Dieudonne determinant of the polynomial coefficients. Additionally, we apply noncommutative versions of evaluation and interpolation techniques to the computation process to improve the efficiency of the method. The implementation of the algorithms will be performed in Maple to evaluate the performance of the approaches.
Keywords
Cite
@article{arxiv.2105.14799,
title = {Resultant-based Elimination in Ore Algebra},
author = {Raqeeb Rasheed},
journal= {arXiv preprint arXiv:2105.14799},
year = {2022}
}
Comments
An updated (and shorter) version published in the SYNASC '21 proceedings (IEEE CS) with the title "Resultant-based Elimination for Skew Polynomials"