Related papers: An Orlov theorem for matrix factorizations with mu…
It is known that the number of minimal factorizations of the long cycle in the symmetric group into a product of $k$ cycles of given lengths has a very simple formula: it is $n^{k-1}$ where $n$ is the rank of the underlying symmetric group…
We consider algorithms for the factorization of linear partial differential operators. We introduce several new theoretical notions in order to simplify such considerations. We define an obstacle and a ring of obstacles to factorizations.…
We give a complete factorization of the invariant factors of resultant matrices built from birational parameterizations of rational plane curves in terms of the singular points of the curve and their multiplicity graph. This allows us to…
Kuznetsov showed that for a flat quadric fibration $\mathcal{Q}$ over a smooth base $S$, $\mathrm{D}^b(\mathcal{Q})$ admits a semiorthogonal decomposition where one of the components is the derived category of the sheaf of even parts of a…
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…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
For a commutative ring $S$ and self-orthogonal subcategory $\mathsf{C}$ of $\mathsf{Mod}(S)$, we consider matrix factorizations whose modules belong to $\mathsf{C}$. Let $f\in S$ be a regular element. If $f$ is $M$-regular for every $M\in…
In this paper we propose a general spectral theory for tensors. Our proposed factorization decomposes a tensor into a product of orthogonal and scaling tensors. At the same time, our factorization yields an expansion of a tensor as a…
Motivated by an application in computational biology, we consider low-rank matrix factorization with $\{0,1\}$-constraints on one of the factors and optionally convex constraints on the second one. In addition to the non-convexity shared…
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…
This paper presents an adaptive randomized algorithm for computing the butterfly factorization of a $m\times n$ matrix with $m\approx n$ provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The…
Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…
In this paper we show that every object in the dg category of relative singularities Sing$(B,\underline{f})$ associated to a pair $(B,\underline{f})$, where $B$ is a ring and $\underline{f}\in B^n$, is equivalent to a retract of a…
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…
In this paper, we prove a generalization of Orlov's projectivization formula for the derived category $D^b_{\rm coh} (\mathbb{P}(\mathscr{E}))$, where $\mathscr{E}$ does not need to be a vector bundle; Instead, $\mathscr{E}$ is a coherent…
The problem of matrix factorization motivated by diffraction or elasticity is studied. A powerful tool for analyzing its solutions is introduced, namely analytical continuation formulae are derived. Necessary condition for commutative…
For a function $W\in \mathbb{C}[X]$ on a smooth algebraic variety $X$ with Morse-Bott critical locus $Y\subset X$, Kapustin, Rozansky and Saulina suggest that the associated matrix factorisation category $\mathrm{MF}(X;W)$ should be…
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…
The paper introduces the butterfly factorization as a data-sparse approximation for the matrices that satisfy a complementary low-rank property. The factorization can be constructed efficiently if either fast algorithms for applying the…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…