Related papers: On 3-matrix factorizations of polynomials
We formulate and prove a criterion for reducibility of a quadratic polynomial over the integers. The main theorem was suggested by the teaching experience with the concrete material called "the polynomial box". Through the corollaries we…
This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…
Let P be a commutative Noetherian ring, K be an ideal of P which is generated by a regular sequence of length four, f be a regular element of P, and Pbar be the hypersurface ring P/(f). Assume that K:f is a grade four Gorenstein ideal of P.…
In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this…
We describe a procedure that creates an explicit complex-valued polynomial function of three-dimensional space, whose nodal lines are the three-twist knot $5_2$. The construction generalizes a similar approach for lemniscate knots: a braid…
Let $f_1,...,f_s \in \mathbb{K}[x_1,...,x_m]$ be a system of polynomials generating a zero-dimensional ideal $\I$, where $\mathbb{K}$ is an arbitrary algebraically closed field. We study the computation of "matrices of traces" for the…
We study solutions of the Yang-Baxter equation on a tensor product of an arbitrary finite-dimensional and an arbitrary infinite-dimensional representations of the rank one symmetry algebra. We consider the cases of the Lie algebra sl_2, the…
We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations. Topics covered include…
For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…
In this paper, we intend to present a new algorithm to factorize large numbers. According to the algorithm proposed here, we prove that there is a common factor between p and q. With this procedure, the time of factorization considerably…
In this paper, we develop a polynomial time algorithm to compute a Dulmage-Mendelsohn-type decomposition of a matrix partitioned into submatrices of rank at most $1$.
The problem of matrix factorization motivated by diffraction or elasticity is studied. A powerful tool for analyzing its solutions is introduced, namely analytical continuation formulae are derived. Necessary condition for commutative…
We construct a class of representations of the quadratic R-matrix algebra, given by the reflection equation with the spectral parameter, in terms of certain ordinary difference operators. These operators turn out to act as parameter…
The Khatri-Rao product is extensively used in array processing, tensor decomposition, and multi-way data analysis. Many applications require a least-squares (LS) Khatri-Rao factorization. In broadband sensor array problems, polynomial…
Factorization of polynomials is one of the foundations of symbolic computation. Its applications arise in numerous branches of mathematics and other sciences. However, the present advanced programming languages such as C++ and J++, do not…
In this tutorial, exponentiation and factorization (decomposition) formulas are derived and discussed for common matrix operators that arise in studies of classical dynamics, linear and nonlinear optics, and special relativity. To…
A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…
We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…
Factorial clustering methods have been developed in recent years thanks to the improving of computational power. These methods perform a linear transformation of data and a clustering on transformed data optimizing a common criterion.…
In this work we deduce explicit formulae for the elements of the matrices that represent the action of integro-differential operators over the coefficients of generalized Fourier series. Our formulae are obtained by performing operations on…