Related papers: On tensor products of matrix factorizations

In this paper, we present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural…

Let $T$ be a quadratic operator on a complex Hilbert space $H$. We show that $T$ can be written as a product of two positive contractions if and only if $T$ is of the form $$aI \oplus bI \oplus\begin{pmatrix} aI & P \cr 0 & bI \cr…

We introduce a braid group action on $l$-tuple of rational functions for the finite-dimensional representations of Yangians $Y(\mathfrak{g})$, where $\mathfrak{g}$ is a complex simple Lie algebra. It provides an efficient way to compute…

The proliferation of mobile devices has led to the collection of large amounts of population data. This situation has prompted the need to utilize this rich, multidimensional data in practical applications. In response to this trend, we…

We study matrix factorization and curved module categories for Landau-Ginzburg models (X,W) with X a smooth variety, extending parts of the work of Dyckerhoff. Following Positselski, we equip these categories with model category structures.…

Many applications, including rank aggregation and crowd-labeling, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and columns. We consider the problem of estimating such a matrix based on…

Let g be a simple simply laced Lie algebra. In this paper two families of varieties associated to the Dynkin graph of g are described: ``tensor product'' and ``multiplicity'' varieties. These varieties are closely related to Nakajima's…

We compute the equivariant K-theoretic Donaldson--Thomas invariants of $[\mathbb{C}^2/\mu_r]\times \mathbb{C}$ using factorization and rigidity techniques. For this, we develop a generalization of Okounkov's factorization technique that…

This paper introduces the multidimensional butterfly factorization as a data-sparse representation of multidimensional kernel matrices that satisfy the complementary low-rank property. This factorization approximates such a kernel matrix of…

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…

It is a classical theorem that the free product of ordered groups is orderable. In this note we show that, using a method of G. Bergman, an ordering of the free product can be constructed in a functorial manner, in the category of ordered…

Permutation invariant polynomial functions of matrices have previously been studied as the observables in matrix models invariant under $S_N$, the symmetric group of all permutations of $N$ objects. In this paper, the permutation invariant…

We analyse the matrix factorization problem. Given a noisy measurement of a product of two matrices, the problem is to estimate back the original matrices. It arises in many applications such as dictionary learning, blind matrix…

Factorization Machines (FM) are powerful class of models that incorporate higher-order interaction among features to add more expressive power to linear models. They have been used successfully in several real-world tasks such as…

We exhibit a randomized algorithm which given a matrix $A\in \mathbb{C}^{n\times n}$ with $\|A\|\le 1$ and $\delta>0$, computes with high probability an invertible $V$ and diagonal $D$ such that $\|A-VDV^{-1}\|\le \delta$ using…

We give an explicit construction of the factorizing twists for the Yangian Y(sl_2) in evaluation representations (not necessarily finite-dimensional). The result is a universal expression for the factorizing twist that holds in all these…

We use the method of the tensor product graph to construct rational (Yangian invariant) solutions of the Yang-Baxter equation in fundamental representations of $c_n$ and thence the full set of $c_n$-invariant factorized $S$-matrices. Brief…

Sparse matrix factorization is a popular tool to obtain interpretable data decompositions, which are also effective to perform data completion or denoising. Its applicability to large datasets has been addressed with online and randomized…

This article generalizes a recently introduced procedure to solve nonlinear systems of equations, radically departing from the conventional Newton-Raphson scheme. The original nonlinear system is first unfolded into three simpler…

Let $A$ be a matrix with nonnegative real entries. A nonnegative factorization of size $k$ is a representation of $A$ as a sum of $k$ nonnegative rank-one matrices. The space of all such factorizations is a bounded semialgebraic set, and we…