Department of Mathematics, University of Sfax, 3000, Sfax, Tunisia
10.22034/kjm.2022.331453.2498
Abstract
We propose two algorithms that for any ring $R$, given a doubly unitary Laurent polynomial $g \in R[X,X^{-1} ]$, compute $h \in R[X,X^{-1}] $ such that $gh \in R[ X^{-1}+X ]$ and $gh$ is monic. The first algorithm is directly extracted from the classical proof. The second algorithm is more direct and simpler. It relies on a symmetrization technique.
Yengui, I., & Ben Amor, F. (2022). An algorithm for doubly unitary Laurent polynomials. Khayyam Journal of Mathematics, 8(2), 228-233. doi: 10.22034/kjm.2022.331453.2498
MLA
Ihsen Yengui; Faten Ben Amor. "An algorithm for doubly unitary Laurent polynomials". Khayyam Journal of Mathematics, 8, 2, 2022, 228-233. doi: 10.22034/kjm.2022.331453.2498
HARVARD
Yengui, I., Ben Amor, F. (2022). 'An algorithm for doubly unitary Laurent polynomials', Khayyam Journal of Mathematics, 8(2), pp. 228-233. doi: 10.22034/kjm.2022.331453.2498
VANCOUVER
Yengui, I., Ben Amor, F. An algorithm for doubly unitary Laurent polynomials. Khayyam Journal of Mathematics, 2022; 8(2): 228-233. doi: 10.22034/kjm.2022.331453.2498