Related papers: Matrix factorizations and semi-orthogonal decompos…

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…

From the classic work of Gohberg and Krein (1958), it is well known that the set of partial indices of a non-singular matrix function may change depending on the properties of the original matrix. More precisely, it was shown that if the…

Let $X$ be a smooth scheme with an action of an algebraic group $G$. We establish an equivalence of two categories related to the corresponding moment map $\mu : T^*X \to Lie(G)^*$ - the derived category of G-equivariant coherent sheaves on…

The derived category of a hypersurface has an action by "cohomology operations" k[t], deg t=-2, underlying the 2-periodic structure on its category of singularities (as matrix factorizations). We prove a Thom-Sebastiani type Theorem,…

Recently, convex formulations of low-rank matrix factorization problems have received considerable attention in machine learning. However, such formulations often require solving for a matrix of the size of the data matrix, making it…

We establish a correspondence between consistent comprehension schemes and complete orthogonal factorisation systems. The comprehensive factorisation of a functor between small categories arises in this way. Similar factorisation systems…

We define strict and lax orthogonal factorization systems on double categories. These consist of an orthogonal factorization system on arrows and one on double cells that are compatible with each other. Our definitions are motivated by…

Matrix factorization is an important mathematical problem encountered in the context of dictionary learning, recommendation systems and machine learning. We introduce a new `decimation' scheme that maps it to neural network models of…

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ and $S=$ $K[y_{1},y_{2},\cdots, y_{m}]$ where $K$ is a field. %commutative ring with unity. In this paper, we propose a method showing how to obtain $3$-matrix factors for a given polynomial using either…

This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…

Generalizing Eisenbud's matrix factorizations, we define factorization categories. Following work of Positselski, we define their associated derived categories. We construct specific resolutions of factorizations built from a choice of…

In this paper we continue the study of triangular matrix categories $\mathbf{\Lambda}=\left[ \begin{smallmatrix} \mathcal{T} & 0 \\ M & \mathcal{U} \end{smallmatrix}\right]$ initiated in [21]. First, given an additive category $\mathcal{C}$…

Let $X$ be a fixed projective scheme which is flat over a base scheme $S$. The association taking a quasi-projective $S$-scheme $Y$ to the scheme parametrizing $S$-morphisms from $X$ to $Y$ is functorial. We prove that this functor…

We consider the canonical Wiener-Hopf factorisation of $2 \times 2$ symmetric matrices $\mathcal M$ with respect to a contour $\Gamma$. For the case that the quotient $q$ of the two diagonal elements of $\mathcal M$ is a rational function,…

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…

This paper introduces a mathematical definition of the category of D-branes in Landau-Ginzburg orbifolds in terms of $A_\infty$-categories. Our categories coincide with the categories of (graded) matrix factorizations for quasi-homogeneous…

We construct an iterative method for factorising small strict n-categories into a unique (up to isomorphism) collection of small 1- categories. Following this we develop the theory to include a large class of $\infty$-categories. We use…

Randomized sampling has recently been demonstrated to be an efficient technique for computing approximate low-rank factorizations of matrices for which fast methods for computing matrix vector products are available. This paper describes an…

Given a variety $Y$ with a rectangular Lefschetz decomposition of its derived category, we consider a degree $n$ cyclic cover $X \to Y$ ramified over a divisor $Z \subset Y$. We construct semiorthogonal decompositions of $\mathrm{D^b}(X)$…

In this paper, we first introduce geometric operations for linear categories, and as a consequence generalize Orlov's blow up formula [O04] to possibly singular local complete intersection centres. Second, we introduce refined blowing up of…