Related papers: An Algorithm for the Factorization of Split Quater…

Non-negative Matrix Factorization (NMF) asks to decompose a (entry-wise) non-negative matrix into the product of two smaller-sized nonnegative matrices, which has been shown intractable in general. In order to overcome this issue, the…

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

We study zero-divisors in the $16$-dimensional sedenion algebra from the viewpoint of the determinant of left multiplication. We show that this determinant admits a canonical factorization into the square of a quartic polynomial, obtained…

Real and virtual corrections in NNLO QCD require multi-dimensional integrals with overlapping singularities. We first review ideas and methods which have been proposed for performing such computations. We then present a new method for the…

This paper investigates the construction of rational motions of a minimal quaternionic degree that generate a prescribed plane trajectory (a ``rational torse''). Using the algebraic framework of dual quaternions, we formulate the problem as…

The satisfactory development of Quaternionic Analysis has indicated new solutions for physical and mathematical problems. It is worth mentioning the fact that quaternions possess four dimensions, and in this way they may be considered as…

In this text, we study factorizations of polynomials over the tropical hyperfield and the sign hyperfield, which we call `tropical polynomials' and `sign polynomials', respectively. We classify all irreducible polynomials in either case. We…

With the recent success of representation learning methods, which includes deep learning as a special case, there has been considerable interest in developing representation learning techniques that can incorporate known physical…

Cardinal's factorization algorithm of 1996 splits a univariate polynomial into two factors with root sets separated by the imaginary axis, which is an important goal itself and a basic step toward root-finding. The novelty of the algorithm…

A non-iterative method is presented for the factorization step of sector decomposition method, which separates infrared divergent part from loop integration. This method is based on a classification of asymptotic behavior of polynomials.…

An algorithm is designed which decomposes a tropical univariate rational function into a composition of tropical binomials and trinomials. When a function is monotone, the composition consists just of binomials. Similar algorithms are…

In this paper we consider linear combinations of two trivariate homogeneous polynomials of second degree. We formulate and solve two problems: i) Characterization of polynomials for which all linear combinations are factorizable. ii) How…

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…

In this article we will apply the first- and second-order supersymmetric quantum mechanics to obtain new exactly-solvable real potentials departing from the inverted oscillator potential. This system has some special properties; in…

Quaternion symmetry is ubiquitous in the physical sciences. As such, much work has been afforded over the years to the development of efficient schemes to exploit this symmetry using real and complex linear algebra. Recent years have also…

In this paper we study the problem of efficiently factorizing polynomials in the free noncommutative ring F of polynomials in noncommuting variables x1,x2,...,xn over the field F. We obtain the following result Given a noncommutative…

We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…

For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

A split hypercomplex learning algorithm for the training of nonlinear finite impulse response adaptive filters for the processing of hypercomplex signals of any dimension is proposed. The derivation strictly takes into account the laws of…