相关论文: Fundamental matrix factorization in the FJRW-theor…
We define enumerative invariants associated to a hybrid Gauged Linear Sigma Model. We prove that in the relevant special cases, these invariants recover both the Gromov-Witten type invariants defined by Chang-Li and Fan-Jarvis-Ruan using…
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…
We study categories of matrix factorizations. These categories are defined for any regular function on a suitable regular scheme. Our paper has two parts. In the first part we develop the foundations; for example we discuss derived direct…
We prove a Fej\'er-Riesz type factorization for positive matrix-valued noncommutative trigonometric polynomials on $\mathscr{W}\times\mathfrak{Y}$, where $\mathscr{W}$ is either the free semigroup $\langle x \rangle_g$ or the free product…
We prove a generalization of Orlov's theorem for matrix factorizations with $n$ steps. Let $X$ be a regular scheme, $W\colon X\to \mathbb{A}^1$ a flat morphism and $D:=W^{-1}(0)$ its central fiber. We construct an appropriate triangulated…
Theory of matrix factorizations is useful to study hypersurfaces in commutative algebra. To study noncommutative hypersurfaces, which are important objects of study in noncommutative algebraic geometry, we introduce a notion of…
We study matrix factorizations of locally free coherent sheaves on a scheme. For a scheme that is projective over an affine scheme, we show that homomorphisms in the homotopy category of matrix factorizations may be computed as the…
We study the homotopy category $\mathrm{hmf}(R,W)$ of matrix factorizations of non-zero elements $W\in R^\times$, where $R$ is an elementary divisor domain. When $R$ has prime elements and $W$ factors into a square-free element $W_0$ and a…
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…
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…
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…
We present a fast direct algorithm for computing symmetric factorizations, i.e. $A = WW^T$, of symmetric positive-definite hierarchical matrices with weak-admissibility conditions. The computational cost for the symmetric factorization…
Nonnegative matrix factorizations are often encountered in data mining applications where they are used to explain datasets by a small number of parts. For many of these applications it is desirable that there exists a unique nonnegative…
We give a purely algebraic construction of a cohomological field theory associated with a quasihomogeneous isolated hypersurface singularity W and a subgroup G of the diagonal group of symmetries of W. This theory can be viewed as an…
We introduce a Generalized Randomized QR-decomposition that may be applied to arbitrary products of matrices and their inverses, without needing to explicitly compute the products or inverses. This factorization is a critical part of a…
Nonnegative matrix factorization (NMF) is a linear dimensionality technique for nonnegative data with applications such as image analysis, text mining, audio source separation and hyperspectral unmixing. Given a data matrix $M$ and a…
This paper provides a theoretical explanation on the clustering aspect of nonnegative matrix factorization (NMF). We prove that even without imposing orthogonality nor sparsity constraint on the basis and/or coefficient matrix, NMF still…
Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity…
Let G be a block matrix function with one diagonal block A being positive definite and the off diagonal blocks complex conjugates of each other. Conditions are obtained for G to be factorable (in particular, with zero partial indices) in…
We study matrix factorizations of a section W of a line bundle on an algebraic stack. We relate the corresponding derived category (the category of D-branes of type B in the Landau-Ginzburg model with potential W) with the singularity…