Related papers: Matrix factorizations and semi-orthogonal decompos…
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…
Consistent factorization theorems in high-energy scattering near the threshold are presented in the framework of the soft-collinear effective theory. Traditional factorization theorem separates the soft and collinear parts successfully, but…
The central object of study in this paper are infinite banded Hessenberg matrices admitting factorisations as products of bidiagonal matrices. In the two main novel results of this paper, we show that these Hessenberg matrices are…
Factorization machines and polynomial networks are supervised polynomial models based on an efficient low-rank decomposition. We extend these models to the multi-output setting, i.e., for learning vector-valued functions, with application…
Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…
Nonnegative matrix factorization (NMF) is widely used for clustering with strong interpretability. Among general NMF problems, symmetric NMF is a special one that plays an important role in graph clustering where each element measures the…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
We present an improved construction of the fundamental matrix factorization in the FJRW-theory given in arXiv:1105.2903. The revised construction is coordinate-free and works for a possibly nonabelian finite group of symmetries. One of the…
A famous theorem of D. Orlov describes the derived bounded category of coherent sheaves on projective hypersurfaces in terms of an algebraic construction called graded matrix factorizations. In this article, I implement a proposal of E.…
We consider the problem of learning a low-rank matrix, constrained to lie in a linear subspace, and introduce a novel factorization for modeling such matrices. A salient feature of the proposed factorization scheme is it decouples the…
The notion of semi-unital semi-monoidal category was defined a couple of years ago using the so called "Takahashi tensor product" and so far, the only example of it in the literature is complex. In this paper, we use the recently defined…
We continue studying the problem of analytic approximation of matrix functions. We introduce the notion of a partial canonical factorization of a badly approximable matrix function $\Phi$ and the notion of a canonical factorization of a…
Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…
We propose a novel factorization of a non-singular matrix $P$, viewed as a $2\times 2$-blocked matrix. The factorization decomposes $P$ into a product of three matrices that are lower block-unitriangular, upper block-triangular, and lower…
Let S be the spectrum of a discrete valuation ring with function field K. Let X be a scheme over S. We will say that X is semi-factorial over S if each invertible sheaf on the generic fiber X_K can be extended to an invertible sheaf on X.…
We prove that the $\infty$-category of orthogonal factorization systems embeds fully faithfully into the $\infty$-category of double $\infty$-categories. Moreover, we prove an (un)straightening equivalence for double $\infty$-categories,…
We present general techniques for constructing functorial factorizations appropriate for model structures that are not known to be cofibrantly generated. Our methods use "algebraic" characterizations of fibrations to produce factorizations…
Modular functors are traditionally defined as systems of projective representations of mapping class groups of surfaces that are compatible with gluing. They can formally be described as modular algebras over central extensions of the…
Braid matrices $\hat{R}(\theta)$, corresponding to vector representations, are spectrally decomposed obtaining a ratio $f_{i}(\theta)/f_{i}(-\theta)$ for the coefficient of each projector $P_{i}$ appearing in the decomposition. This…
The aim of this paper is to introduce and study a large class of $\mathfrak{g}$-module algebras which we call factorizable by generalizing the Gauss factorization of (square or rectangular) matrices. This class includes coordinate algebras…