Factorization in Quantum Planes

Given a univariate polynomial f(x) over a ring R, we examine when we can write f(x) as g(h(x)) where g and h are polynomials of degree at least 2. We answer two questions of Gusic regarding when the existence of such g and h over an extension of R implies the existence of such g and h over R. We also pose two new questions along these lines.

In this paper, we provide the degree distribution of irreducible factors of the composed polynomial $f(L(x))$ over $\mathbb F_q$, where $f(x)\in \mathbb F_q[x]$ is irreducible and $L(x)\in \mathbb F_q[x]$ is a linearized polynomial. We further provide some applications of our main result, including lower bounds for the number of irreducible factors of $f(L(x))$, constructions of high degree irreducible polynomials and the explicit factorization of $f(x^q-x)$ under certain con...

We consider a series of questions that grew out of determining when two quantum planes are isomorphic. In particular, we consider a similar question for quantum matrix algebras and certain ambiskew polynomial rings. Additionally, we modify a result by Alev and Dumas to show that two quantum Weyl algebras are isomorphic if and only if their parameters are equal or inverses of each other.

We investigate factorizability of a quadratic split quaternion polynomial. In addition to inequality conditions for existence of such factorization, we provide lucid geometric interpretations in the projective space over the split quaternions.

We present an algorithm to compute all factorizations into linear factors of univariate polynomials over the split quaternions, provided such a factorization exists. Failure of the algorithm is equivalent to non-factorizability for which we present also geometric interpretations in terms of rulings on the quadric of non-invertible split quaternions. However, suitable real polynomial multiples of split quaternion polynomials can still be factorized and we describe how to find ...

The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm. It is randomized and takes $\widetilde{O}(n^{3/2}\log q + n \log^2 q)$ time to factor polynomials of degree $n$ over the finite field $\mathbb{F}_q$ with $q$ elements. A significant open problem is if the $3/2$ exponent can be improved. We study a collection of algebraic problems and establish a web...

New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the complexity of factorization. Currently used keys are chosen on the basis of the present algorithmic knowledge and, thus, can potentially be subject to future breaches. For this reason, it is worth to investigate new approaches which have the p...

Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for which there are known numerical methods for polynomial root approximation. The sole purpose of the present paper is to present a polynomial factorization algorithm for division quaternion algebras over number fields, together with its adaptat...

Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to prove finitness of integral solutions of the equations $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = Ey^{m_1}+Fy^{m_2}+Gy^{m_3}+H, $$ where $A,B,C,D,E,F,G,H$ are rational numbers $ABCEFG \neq 0$ and $n_1>n_2>n_3>0$, $m_1>m_2>m_3>0$, $\gcd(n_1,n_2,n_3) =...

We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new consequences, including a necessary condition for the algebraic solution by radicals of certain irreducible polynomials.