Related papers: Matrix factorizations and semi-orthogonal decompos…
Any modality in homotopy type theory gives rise to an orthogonal factorization system of which the left class is stable under pullbacks. We show that there is a second orthogonal factorization system associated to any modality, of which the…
Optimization problems with rank constraints arise in many applications, including matrix regression, structured PCA, matrix completion and matrix decomposition problems. An attractive heuristic for solving such problems is to factorize the…
For two types of moderate growth representations of $(\mathbb{R}^d,+)$ on sequentially complete locally convex Hausdorff spaces (including F-representations [J. Funct. Anal. 262 (2012), 667-681], we introduce Denjoy-Carleman classes of…
We write out explicit proper Calabi-Yau structures, i. e. non-degenerate cyclic cocycles on the differential graded categories of matrix factorizations of regular functions with isolated critical points. The formulas involve the Kapustin-Li…
We derive approximation algorithms for the nonnegative matrix factorization problem, i.e. the problem of factorizing a matrix as the product of two matrices with nonnegative coefficients. We form convex approximations of this problem which…
A method is proposed to streamline the computation of hidden particle production rates by factorizing them into i) a model-independent SM contribution, and ii) a observable-independent hidden sector contribution. The Standard Model (SM)…
We begin the study of categorifications of Donaldson-Thomas invariants associated with Hilbert schemes of points on the three-dimensional affine space, which we call DT categories. The DT category is defined to be the category of matrix…
In this note, firstly we give an easy proof of the factorization of symmetric matrices (see [Mos] math-ph/0203023), then we use it to prove the well-known fact that the automorphism group of a non-degenerate symmetric bilinear form acts…
We outline the theory of reflections for prederivators, derivators and stable derivators. In order to parallel the classical theory valid for categories, we outline how reflections can be equivalently described as categories of fractions,…
For an effective Cartier divisor D on a scheme X we may form an nth root stack. Its derived category is known to have a semiorthogonal decomposition with components given by D and X. We show that this decomposition is 2n-periodic. For n=2…
We show factorization formulas for a class of partition functions of rational six vertex model. First we show factorization formulas for partition functions under triangular boundary. Further, by combining the factorization formulas with…
The symmetric Nonnegative Matrix Factorization (NMF), a special but important class of the general NMF, has found numerous applications in data analysis such as various clustering tasks. Unfortunately, designing fast algorithms for the…
We discuss Calabi-Yau and fractional Calabi-Yau semiorthogonal components of derived categories of coherent sheaves on smooth projective varieties. The main result is a general construction of a fractional Calabi-Yau category from a…
Cut vertices, a generalization of matrix elements of local operators, are revisited, and an expansion in terms of minimally subtracted cut vertices is formulated. An extension of the formalism to deal with semi-inclusive deep inelastic…
Following Mitchell's philosophy, in this paper we define the analogous of the triangular matrix algebra to the context of rings with several objects. Given two additive categories $\mathcal{U}$ and $\mathcal{T}$ and $M\in…
The implementation details of factorizing the 3x4 projection matrices of linear cameras into their left matrix factors and the 4x4 homogeneous central(also parallel for infinite center cases) projection factors are presented in this work.…
Following Krah's method, we construct new examples of phantom categories as semiorthogonal components of the derived categories of two types of rational surfaces: the blowup of the plane at 11 points in general position, and the blowup of…
Matrix factorization exploits the idea that, in complex high-dimensional data, the actual signal typically lies in lower-dimensional structures. These lower dimensional objects provide useful insight, with interpretability favored by sparse…
Nonnegative matrix factorization can be used to automatically detect topics within a corpus in an unsupervised fashion. The technique amounts to an approximation of a nonnegative matrix as the product of two nonnegative matrices of lower…
Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…