Factorization of Z-homogeneous polynomials in the first q-Weyl algebra

From MaRDI portal
Publication:4556586



Abstract: We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and q-Weyl algebra, which are both viewed as a mathbbZ-graded rings. We show, that factorization of homogeneous polynomials can be almost completely reduced to commutative univariate factorization over the same base field with some additional uncomplicated combinatorial steps. This allows to deduce the complexity of our algorithms in detail. Furthermore, we will show for homogeneous polynomials that irreducibility in the polynomial first Weyl algebra also implies irreducibility in the rational one, which is of interest for practical reasons. We report on our implementation in the computer algebra system extsc{Singular}. It outperforms for homogeneous polynomials currently available implementations dealing with factorization in the first Weyl algebra both in speed and elegancy of the results.




Cites work



Describes a project that uses

Uses Software






This page was built for publication: Factorization of \( \mathbb {Z}\)-homogeneous polynomials in the first \(q\)-Weyl algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4556586)