Related papers: On factorisation systems for Ord-enriched categori…
We define the triangulated category of relative singularities of a closed subscheme in a scheme. When the closed subscheme is a Cartier divisor, we consider matrix factorizations of the related section of a line bundle, and their analogues…
We present a construction of stable diagonal factorizations, used to define categorical models of type theory with identity types, from a family of algebraic weak factorization systems on the slices of a category. Inspired by a…
While existing algorithms may be used to solve a linear system over a general field in matrix-multiplication time, the complexity of constructing a symmetric triangular factorization (LDL) has received relatively little formal study. The…
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…
Every Grothendieck fibration gives rise to a vertical/cartesian orthogonal factorization system on its domain. We define a cartesian factorization system to be an orthogonal factorization in which the left class satisfies 2-of-3 and is…
We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…
After a brief introduction to the problem of subtraction of infrared divergences for high-order collider observables, we present a preliminary study of strongly-ordered soft and collinear multiple radiation from the point of view of…
Branes and defects in topological Landau-Ginzburg models are described by matrix factorisations. We revisit the problem of deforming them and discuss various deformation methods as well as their relations. We have implemented these…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We study conditions under which a partial differential operator of arbitrary order $n$ in two variables or ordinary linear differential operator admits a factorization with a first-order factor on the left. The factorization process…
Gradient descent for matrix factorization exhibits an implicit bias toward approximately low-rank solutions. While existing theories often assume the boundedness of iterates, empirically the bias persists even with unbounded sequences. This…
Latent fibrations are an adaptation, appropriate for categories of partial maps (as presented by restriction categories), of the usual notion of fibration. The paper initiates the development of the basic theory of latent fibrations and…
This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…
We give a constructive proof of the factorization theorem for the classical Hardy space in terms of fractional integral operator. Moreover, the result is extended to the multilinear case and weighted case. As an application, we obtain the…
The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…
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 investigate tensor products of matrix factorisations. This is most naturally done by formulating matrix factorisations in terms of bimodules instead of modules. If the underlying ring is C[x_1,...,x_N] we show that bimodule matrix…
This paper introduces an algorithm for the nonnegative matrix factorization-and-completion problem, which aims to find nonnegative low-rank matrices X and Y so that the product XY approximates a nonnegative data matrix M whose elements are…
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…