Related papers: Quadratic Spinor Polynomials with Infinitely Many …
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…
Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…
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…
In this paper, we consider the existence of a factorization of a monic, bounded motion polynomial. We prove existence of factorizations, possibly after multiplication with a real polynomial and provide algorithms for computing polynomial…
We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.
A superintegrable system is, roughly speaking, a system that allows more integrals of motion than degrees of freedom. This review is devoted to finite dimensional classical and quantum superintegrable systems with scalar potentials and…
We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…
We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…
A polynomial transformation of the real plane $\Bbb R^2$ is a mapping $\Bbb R^2\to\Bbb R^2$ given by two polynomials of two variables. Such a transformation is called quadratic if the degrees of its polynomials are not greater than two. In…
In this paper we investigate factorizations of polynomials over the ring of dual quaternions into linear factors. While earlier results assume that the norm polynomial is real ("motion polynomials"), we only require the absence of real…
A polynomial transformation of the real plane $\Bbb R^2$ is a mapping $\Bbb R^2\to\Bbb R^2$ given by two polynomials of two variables. Such a transformation is called cubic if the degrees of its polynomials are not greater than three. It…
We propose a geometric explanation for the observation that generic quadratic polynomials over split quaternions may have up to six different factorizations while generic polynomials over Hamiltonian quaternions only have two. Split…
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…
Any nonsingular function of spin j matrices always reduces to a matrix polynomial of order 2j. The challenge is to find a convenient form for the coefficients of the matrix polynomial. The theory of biorthogonal systems is a useful…
Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
Quantum signal processing is a framework for implementing polynomial functions on quantum computers. To implement a given polynomial $P$, one must first construct a corresponding complementary polynomial $Q$. Existing approaches to this…
This paper shows that orbital equations generated by iteration of polynomial maps do not have necessarily a unique representation. Remarkably, they may be represented in an infinity of ways, all interconnected by certain nonlinear…
A polynomial transformation of the real plane $\Bbb R^2$ is a mapping $\Bbb R^2\to\Bbb R^2$ given by two polynomials of two variables. Such a transformation is called cubic if the degrees of its polynomials are not greater than three. In…