Related papers: On tensor products of matrix factorizations

Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…

We propose a specific class of matrices which participate in factorization problems that turn to be equivalent to constant and entwining (non-constant) pentagon, reverse-pentagon or Yang-Baxter maps, expressed in non-commutative variables.…

As is known, there exists an alternative, "non-matricial" way to present basic notions and results of quantum functional analysis (= operator space theory). This approach is based on considering, instead of matrix spaces, a single space,…

We introduce and extend the outer product and contractive product of tensors and matrices, and present some identities in terms of these products. We offer tensor expressions of derivatives of tensors, focus on the tensor forms of…

We here first study the state space realization of a tensor-product of a pair of rational functions. At the expense of "inflating" the dimensions, we recover the classical expressions for realization of a regular product of rational…

Factorization of matrices where the rank of the two factors diverges linearly with their sizes has many applications in diverse areas such as unsupervised representation learning, dictionary learning or sparse coding. We consider a setting…

Working over an algebraically closed field $k$ of any characteristic, we determine the matrix factorizations for the --- suitably graded --- triangle singularities $f=x^a+y^b+z^c$ of domestic type, that is, we assume that $(a,b,c)$ 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…

Tensor factorization arises in many machine learning applications, such knowledge base modeling and parameter estimation in latent variable models. However, numerical methods for tensor factorization have not reached the level of maturity…

We determine the composition factors of the tensor product $S(E)\otimes S(E)$ of two copies of the symmetric algebra of the natural module $E$ of a general linear group over an algebraically closed field of positive characteristic. Our main…

Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…

We present a simple randomized polynomial time algorithm to approximate the mixed discriminant of $n$ positive semidefinite $n \times n$ matrices within a factor $2^{O(n)}$. Consequently, the algorithm allows us to approximate in randomized…

We establish a non-commutative version of the Intermediate Factor Theorem for crossed products associated with product lattices. Given an irreducible lattice $\Gamma < G= G_1 \times \dots \times G_d$ in higher rank semisimple algebraic…

In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…

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…

The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…

Disentanglement of constituent factors of a sensory signal is central to perception and cognition and hence is a critical task for future artificial intelligence systems. In this paper, we present a compute engine capable of efficiently…

We introduce a novel framework for Generalized Tensor Transforms (GTTs), constructed through an $n$-fold tensor product of an arbitrary $b \times b$ unitary matrix $W$. This construction generalizes many established transforms, by providing…

Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \bmod…

We show that, for a certain class of partitions and an even number of variables of which half are reciprocals of the other half, Schur polynomials can be factorized into products of odd and even orthogonal characters. We also obtain related…