Related papers: Factoring Octonion Polynomials
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…
We study in detail the zero set of a regular function of a quaternionic or octonionic variable. By means of a division lemma for convergent power series, we find the exact relation existing between the zeros of two octonionic regular…
We discuss the problem of factorisation of the symmetric Macdonald polynomials and present the obtained results for the cases of 2 and 3 variables.
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…
We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…
We present a new method to calculate analytically the roots of the general complex polynomial of degree three. Thismethod is based on the approach of appropriated changes of variable involving an arbitrary parameter. The advantageof this…
We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…
We give an analog of Frobenius' theorem about the factorization of the group determinant on the group algebra of finite abelian groups and we extend it into dihedral groups and generalized quaternion groups. Furthermore, we describe the…
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…
We give a Fourier-type formula for computing the orthogonal Weingarten formula. The Weingarten calculus was introduced as a systematic method to compute integrals of polynomials with respect to Haar measure over classical groups. Although a…
We generalize the classical lifting and recombination scheme for rational and absolute factorization of bivariate polynomials to the case of a critical fiber. We explore different strategies for recombinations of the analytic factors,…
We show that the effective factorization of Ore polynomials over $\mathbb{F}_q(t)$ is still an open problem. This is so because the known algorithm in [1] presents two gaps, and therefore it does not cover all the examples. We amend one of…
We present a new algorithm for the computation of the irreducible factors of degree at most $d$, with multiplicity, of multivariate lacunary polynomials over fields of characteristic zero. The algorithm reduces this computation to the…
We introduce the notions of alternating roots of polynomials and alternating polynomials over a Cayley-Dickson algebra, and prove a connection between the alternating roots of a given polynomial and the roots of the corresponding…
Factorization of an $n\times n$ unitary matrix as a product of $n$ diagonal matrices containing only phases interlaced with $n-1$ orthogonal matrices each one generated by a real vector as well as an explicit form for the Weyl factorization…
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…
In this paper we factorize matrix polynomials into a complete set of spectral factors using a new design algorithm and we provide a complete set of block roots (solvents). The procedure is an extension of the (scalar) Horner method for the…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…