arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.5674cs.SCcs.MS
收藏

第一(q)-Weyl代数中Z-齐次多项式的因式分解

Factorization of Z-homogeneous polynomials in the First (q)-Weyl Algebra

Albert Heinle, Viktor Levandovskyy

摘要:

给出了第一多项式Weyl代数和$q$ -Weyl代数中加权齐次元的分解算法,这两个代数都被看作是$\mathbb{Z}$ -分次环.我们表明,齐次多项式的因式分解几乎可以完全减少到交换的单变量因式分解在相同的基础领域与一些额外的不复杂的组合步骤。这允许详细推导我们的算法的复杂性。此外,我们将证明齐次多项式的不可约在多项式的第一Weyl代数也意味着不可约在合理的,这是感兴趣的实际原因。我们的报告,我们在计算机代数系统\textsc{Singular}的实现。它优于齐次多项式目前可用的实现处理因式分解在第一Weyl代数的速度和elegancy的结果。

英文摘要:

We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-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 \textsc{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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑