Search arXivSearch

arXiv · 2011.01744

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

Abstract

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Johanna Lercher, Daniel F. Scharler, Hans-Peter Schröcker, Johannes Siegele. 2022-02-18. Factorization of Quaternionic Polynomials of Bi-Degree (n,1). https://doi.org/10.1007/s13366-022-00629-z

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA