arXiv subjects

Johanna Lercher

Publications and source records attributed to Johanna Lercher.

2 recordsLinked to original sources

arXiv2022

Factorization of Quaternionic Polynomials of Bi-Degree (n,1)

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 necessary and sufficient condition for existence of a factorization with univariate linear factors that has originally been stated by Skopenkov and Krasauskas. Such a factorization is, in general, non-unique by known factorization results for univariate quaternionic polynomials. We unveil existence of bivariate polynomials with non-unique factorizations that cannot be explained in this way and characterize them geometrically and algebraically. Existence of factorizations is related to the existence of special rulings of two different types (left/right) on the ruled surface parameterized by the bivariate polynomial in the projective space over the quaternions. Special non-uniqueness in above sense can be explained algebraically by commutation properties of factors in suitable factorizations. A necessary geometric condition for this to happen is degeneration to a point of at least one of the left/right rulings.

math.RA↗

arXiv2021

A Multiplication Technique for the Factorization of Bivariate Quaternionic Polynomials

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 linear factors. A necessary condition for existence of univariate factorizations is factorization of the norm polynomial into a product of univariate polynomials. This condition is, however, not sufficient. Our central result states that univariate factorizations exist after multiplication with a suitable univariate real polynomial as long as the necessary factorization condition is fulfilled. We present an algorithm for computing this real polynomial and a corresponding univariate factorization. If a univariate factorization of the original polynomial exists, a suitable input of the algorithm produces a constant multiplication factor, thus giving an a posteriori condition for existence of univariate factorizations. Some factorizations obtained in this way are of interest in mechanism science. We present an example of a curious closed-loop mechanism with eight revolute joints.

math.RA↗