Related papers: Matrix factorizations for domestic triangle singul…

We consider the three-particle scattering S-matrix for the Landau-Lifshitz model by directly computing the set of the Feynman diagrams up to the second order. We show, following the analogous computations for the non-linear Schr\"{o}dinger…

In light of recent data science trends, new interest has fallen in alternative matrix factorizations. By this, we mean various ways of factorizing particular data matrices so that the factors have special properties and reveal insights into…

Automated per-instance algorithm selection and configuration have shown promising performances for a number of classic optimization problems, including satisfiability, AI planning, and TSP. The techniques often rely on a set of features…

We consider multilevel low rank (MLR) matrices, defined as a row and column permutation of a sum of matrices, each one a block diagonal refinement of the previous one, with all blocks low rank given in factored form. MLR matrices extend low…

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…

In this paper, we provide novel algorithms with identifiability guarantees for simplex-structured matrix factorization (SSMF), a generalization of nonnegative matrix factorization. Current state-of-the-art algorithms that provide…

Among (conformal) quantum field theories, the rational conformal field theories are singled out by the fact that their correlators can be constructed from a modular tensor category C with a distinguished object, a symmetric special…

We obtain factorized domain wall partition functions for two sets of trigonometric vertex models: 1. The N-state Deguchi-Akutsu models, for N = {2, 3, 4} (and conjecture the result for all N >= 5), and 2. The sl(r+1|s+1) Perk-Schultz…

I propose a scheme of constructing classical integrable models in 3+1 discrete dimensions, based on a relaxed version of the problem of factorizing a matrix into the product of four matrices of a special form.

This paper considers the problem of positive semidefinite factorization (PSD factorization), a generalization of exact nonnegative matrix factorization. Given an $m$-by-$n$ nonnegative matrix $X$ and an integer $k$, the PSD factorization…

MacMahon enumerated the plane partitions in an $a \times b \times c$ box. These are in bijection to lozenge tilings of a hexagon, to certain perfect matchings, and to families of non-intersecting lattice paths. In this work we consider more…

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…

Matrix factorization is a key tool in data analysis; its applications include recommender systems, correlation analysis, signal processing, among others. Binary matrices are a particular case which has received significant attention for…

The Symmetric Nonnegative Matrix Trifactorization (SN-Trifactorization) is a factorization of an $n \times n$ nonnegative symmetric matrix $A$ of the form $BCB^T$, where $C$ is a $k \times k$ symmetric matrix, and both $B$ and $C$ are…

Manifold regularization methods for matrix factorization rely on the cluster assumption, whereby the neighborhood structure of data in the input space is preserved in the factorization space. We argue that using the k-neighborhoods of all…

In this paper, we compute an explicit matrix factorization of a rank 9 Ulrich sheaf on a general cubic hypersurface of dimension at most 7, whose existence was proved by Manivel. Instead of using invariant theory, we use Shamash's…

Recently, we introduced a new class of symmetry algebras, called satellite algebras, which connect with one another wavefunctions belonging to different potentials of a given family, and corresponding to different energy eigenvalues. Here…

A factorization of an $n \times n$ nonnegative symmetric matrix $A$ of the form $BCB^T$, where $C$ is a $k \times k$ symmetric matrix, and both $B$ and $C$ are required to be nonnegative, is called the Symmetric Nonnegative Matrix…

Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…