Related papers: On 3-matrix factorizations of polynomials
We extend the deformation theory algorithm of matrix factorizations to systems with more than one D-brane. The obstructions to the deformations are F-term equations which can be integrated to an effective superpotential. We demonstrate the…
We introduce meta-factorization, a theory that describes matrix decompositions as solutions of linear matrix equations: the projector and the reconstruction equation. Meta-factorization reconstructs known factorizations, reveals their…
This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…
Matrix factorization is a well-studied task in machine learning for compactly representing large, noisy data. In our approach, instead of using the traditional concept of matrix rank, we define a new notion of link-rank based on a…
We study the problem of decomposition (non-commutative factorization) of linear ordinary differential operators near an irregular singular point. The solution (given in terms of the Newton diagram and the respective characteristic numbers)…
Nonnegative matrix factorization (NMF) is a popular method used to reduce dimensionality in data sets whose elements are nonnegative. It does so by decomposing the data set of interest, $\mathbf{X}$, into two lower rank nonnegative matrices…
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…
We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…
We give a formula for matrix exponentials and partial fraction decompositions.
The tropical arithmetic operations on $\mathbb{R}$ are defined by $a\oplus b=\min\{a,b\}$ and $a\otimes b=a+b$. Let $A$ be a tropical matrix and $k$ a positive integer, the problem of Tropical Matrix Factorization (TMF) asks whether there…
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…
Many applications in scientific computing and data science require the computation of a rank-revealing factorization of a large matrix. In many of these instances the classical algorithms for computing the singular value decomposition are…
We consider the factorization problem in toy models of holography, in SYK and in Matrix Models. In a theory with fixed couplings, we introduce a fictitious ensemble averaging by inserting a projector onto fixed couplings. We compute the…
In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…
Let $R$ be a commutative unital ring. A well-known factorization problem is whether any matrix in $\mathrm{SL}_n(R)$ is a product of elementary matrices with entries in $R$. To solve the problem, we use two approaches based on the notion of…
In this paper, we introduce the new construction of fractional derivatives and integrals with respect to a function, based on a matrix approach. We believe that this is a powerful tool in both analytical and numerical calculations. We begin…
The Boolean matrix factorization problem consists in approximating a matrix by the Boolean product of two smaller Boolean matrices. To obtain optimal solutions when the matrices to be factorized are small, we propose SAT and MaxSAT…
We formulate a conjecture concerning spectral factorization of a class of trigonometric polynomials of two variables and prove it for special cases. Our method uses relations between the distribution of values of a polynomial of two…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…