Related papers: On factorisation systems for Ord-enriched categori…
Beyond leading-order, perturbative QCD requires a choice of factorisation scheme to define the parton distribution functions (PDFs) and hard-process cross-section. The modified minimal-subtraction ($\overline{\mathrm{MS}}$) scheme has long…
We construct a full strongly exceptional collection in the triangulated category of graded matrix factorizations of a polynomial associated to a non-degenerate regular system of weights whose smallest exponents are equal to -1. In the…
Rank regularized minimization problem is an ideal model for the low-rank matrix completion/recovery problem. The matrix factorization approach can transform the high-dimensional rank regularized problem to a low-dimensional factorized…
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…
Low rank matrix factorization is a fundamental building block in machine learning, used for instance to summarize gene expression profile data or word-document counts. To be robust to outliers and differences in scale across features, a…
Let $\mathcal C$ be a category with finite colimits, and let $(\mathcal E,\mathcal M)$ be a factorisation system on $\mathcal C$ with $\mathcal M$ stable under pushouts. Writing $\mathcal C;\mathcal M^{\mathrm{op}}$ for the symmetric…
In this paper we present a new way to construct the pro-category of a category. This new model is very convenient to work with in certain situations. We present a few applications of this new model, the most important of which solves an…
We introduce a new higher categorical structure called a weakly globular n-fold category. This structure is based on iterated internal categories and on the notion of weak globularity. We identify a suitable class of pseudo-functors whose…
We investigate factorisation at small x using a variety of analytical and numerical techniques. Previous results on factorisation in collinear models are generalised to the case of the full BFKL equation, and illustrated in the example of a…
Structure learning methods for covariance and concentration graphs are often validated on synthetic models, usually obtained by randomly generating: (i) an undirected graph, and (ii) a compatible symmetric positive definite (SPD) matrix. In…
We discuss a general method by which a higher order difference equation on a group is transformed into an equivalent triangular system of two difference equations of lower orders. This breakdown into lower order equations is based on the…
We investigate fibrancy conditions in the Thomason model structure on the category of small categories. In particular, we show that the category of weak equivalences of a partial model category is fibrant. Furthermore, we describe…
Mott noted a one-to-one correspondence between saturated multiplicatively closed subsets of a domain D and directed convex subgroups of the group of divisibility D. With this, we construct a functor between inclusions into saturated…
Two common approaches in low-rank optimization problems are either working directly with a rank constraint on the matrix variable, or optimizing over a low-rank factorization so that the rank constraint is implicitly ensured. In this paper,…
We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the material is conjectural, we include systems with conjectured…
The bicategory $\mathcal{LG}$ of Landau-Ginzburg models has polynomials as objects and matrix factorisations as $1$-morphisms. The composition of these $1$-morphisms produces infinite rank matrix factorisations, which is a nuisance. In this…
A notion of a coring extension is defined and it is related to the existence of an additive functor between comodule categories that factorises through forgetful functors. This correspondence between coring extensions and factorisable…
We prove that a weak factorization system on a locally presentable category is accessible if and only if it is small generated in the sense of R. Garner. Moreover, we discuss an analogy of Smith's theorem for accessible model categories.
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…
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…