Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ where $K$ is a field. In this paper, we give some properties of $n$-matrix factorizations of polynomials in $R$. We also derive some results giving some lower bounds on the number of $n$-matrix factors of polynomials. In particular, we give a lower bound on the number of matrix factors of minimal size for the sums of squares polynomial $f_{m}=x_{1}^{2}+\cdots + x_{m}^{2}$ for $m=8$.
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 fact…
We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a factorization algorithm. The asymptotic time complexity in the degree of the given Ore polynomial is studied. In the class of Ore polynomials over a finite field, our algorithm is an alternative to Giesbretch's one that reduces the complexity in the degree of the polynomial.
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 …
For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a product of n irreducibles in Int(Z)={g in Q[x] | g(Z) contained in Z}.
We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear representations. To be more specific, a correspondence between factorizations of an element and upper right blocks of zeros in the system matrix (of its representation) is established. The problem is then reduced to solving a system of polynomial equations (with at most quadratic terms) with commuting unknowns to compute appropriate transformation matrices (if p…
It is known that polynomials over quaternions may have spherical zeros and isolated left and right zeros. These zeros along with appropriately defined multiplicities form the zero structure of a polynomial. In this paper, we equivalently describe the zero structure of a polynomial in terms of its left and right spherical divisors as well as in terms of left and right indecomposable divisors. Several algorithms are proposed to find left/right zeros and left/right spherical divisors of a quaternion polynomial, to construct a polynomial with prescribed zero structure and more generally, to constr…
Given an arbitrary monic polynomial $f$ over a field $F$ of characteristic 0, we use companion matrices to construct a polynomial $M_f\in F[X]$ of minimum degree such that for each root $α$ of $f$ in the algebraic closure of $F$, $M_f(α)$ is equal to the multiplicity $m(α)$ of $α$ as a root of $f$. As an application of $M_f$ we give a new method to compute in $F[X]$ each component of the square-free factorization $f=P_1P_2^2\cdots P_m^m$, where $P_k$ is the product of all $X-α$ with $m(α)=k$, for $k=1, \dots, m=\max m(α)$.
We discuss existence of factorizations with linear factors for (left) polynomials over certain associative real involutive algebras, most notably over Clifford algebras. Because of their relevance to kinematics and mechanism science, we put particular emphasis on factorization results for quaternion, dual quaternion and split quaternion polynomials. A general algorithm ensures existence of a factorization for generic polynomials over division rings but we also consider factorizations for non-division rings. We explain the current state of the art, present some new results and provide examples …
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 polynomial factors in the primal part and factorizability of the norm polynomial over the dual numbers into monic quadratic factors. This obviously necessary condition is also sufficient for existence of factorizations. We present an algorithm to compute factorizations of these polynomials and use it for new constructions of mechanisms which cannot be obtained b…
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.
Motion Polynomials Admitting a Factorization with Linear Factors
Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院）；University of Innsbruck（因斯布鲁克大学）；King Abdullah University of Science and Technology（阿卜杜拉国王科技大学）
This is a survey of recently published results. We introduce and study a wide class algebras associated to directed graphs and related to factorizations of noncommutative polynomials. In particular, we show that for many well-known graphs such algebras are Koszul and compute their Hilbert series.
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 these real polynomials. Split quaternion polynomials describe rational motions in the hyperbolic plane. Factorization wi…
This is an extended version of a talk given at the conference "Algebra and Topology in Interaction" on the occasion of the 70th Anniversary of D.B. Fuchs at UC Davis in September 2009. It is a brief survey of an area originated around 1995 by I. Gelfand and the author.
Theory of matrix factorizations is useful to study hypersurfaces in commutative algebra. To study noncommutative hypersurfaces, which are important objects of study in noncommutative algebraic geometry, we introduce a notion of noncommutative matrix factorization for an arbitrary nonzero non-unit element of a ring. First we show that the category of noncommutative graded matrix factorizations is invariant under the operation called twist (this result is a generalization of the result by Cassidy-Conner-Kirkman-Moore). Then we give two category equivalences involving noncommutative matrix factor…
The notion of a matrix factorization was introduced by Eisenbud in the commutative case in his study of bounded (periodic) free resolutions over complete intersections. In this work, we extend the notion of (homogeneous) matrix factorizations to regular normal elements of connected graded algebras over a field. Next, we relate the category of twisted matrix factorizations to an element over a ring and certain Zhang twists. We also show that in the AS-regular setting, every sufficiently high syzygy module is the cokernel of some twisted matrix factorization. Furthermore, we show that in this se…
The free singularity locus of a noncommutative polynomial f is defined to be the sequence $Z_n(f)=\{X\in M_n^g : \det f(X)=0\}$ of hypersurfaces. The main theorem of this article shows that f is irreducible if and only if $Z_n(f)$ is eventually irreducible. A key step in the proof is an irreducibility result for linear pencils. Apart from its consequences to factorization in a free algebra, the paper also discusses its applications to invariant subspaces in perturbation theory and linear matrix inequalities in real algebraic geometry.
Let $k$ be a perfect field of characteristic $p > 0$, and let $K = k((u))$ be the field of Laurent series over $K$. We study the skew polynomial ring $K[T, Φ]$, where $Φ$ is an endomorphism of $K$ that extends a Frobenius endomorphism of $k$. We give a description of the irreducible skew polynomials, develop an analogue of the theory of the Newton polygon in this context, and classify the similarity classes of irreducible elements.
Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Science（奥地利科学院约翰·拉东计算与应用数学研究所）；University of Innsbruck（因斯布鲁克大学）
We use the recently introduced factorization of motion polynomials for constructing overconstrained spatial linkages with a straight line trajectory. Unlike previous examples, the end-effector motion is not translational and the link graph is a cycle. In particular, we obtain a number of linkages with four revolute and two prismatic joints and a remarkable linkage with seven revolute joints one of whose joints performs a Darboux motion.
We introduce twisted matrix factorizations for quantum complete intersections of codimension two. For such an algebra, we show that in a given dimension, almost all the indecomposable modules with bounded minimal projective resolutions correspond to such matrix factorizations.
