Related papers: On factorisation systems for Ord-enriched categori…
Matrix factorization is a well-studied task in machine learning for compactly representing large, noisy data. In our approach, instead of using the traditional concept of matrix rank, we define a new notion of link-rank based on a…
This article is the continuation of [LS12]. We use categories of matrix factorizations to define a morphism of rings (= a Landau-Ginzburg motivic measure) from the (motivic) Grothendieck ring of varieties over $\mathbb{A}^1$ to the…
Approximate matrix factorization techniques with both nonnegativity and orthogonality constraints, referred to as orthogonal nonnegative matrix factorization (ONMF), have been recently introduced and shown to work remarkably well for…
The small object argument is a method for transfinitely constructing weak factorization systems originally motivated by homotopy theory. We establish a variant of the small object argument that is enriched over a cofibrantly generated weak…
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…
We investigate the categories of weak maps associated to an algebraic weak factorisation system (AWFS) in the sense of Grandis-Tholen. For any AWFS on a category with an initial object, cofibrant replacement forms a comonad, and the…
We introduce a new type of weakly enriched categories over a given symmetric monoidal model category M; these are called Co-Segal categories. Their definition derives from the philosophy of classical (enriched) Segal categories. We study…
We consider the problem of approximating an affinely structured matrix, for example a Hankel matrix, by a low-rank matrix with the same structure. This problem occurs in system identification, signal processing and computer algebra, among…
This thesis is devoted to the proof of a theorem showing the existence of a closed model category structure for weakly enriched categories. It requires first of all the definitions of weakly enriched categories and equivalences of weakly…
We relate weak distributive laws in SetMat to strictly associative (but not strictly unital) pseudoalgebras of the 2-monad (-)^2 on Cat. The corresponding orthogonal factorization systems are characterized by a certain bilinearity property.
Let $S$ be a pomonoid. In this paper, {\bf Pos}-$S$, the category of $S$-posets and $S$-poset maps, is considered. One of the main aims of this paper is to draw attention to the notion of weak factorization systems in {\bf Pos}-$S.$ We show…
This thesis focuses on topics in 2-category theory: in particular on double categories, pseudomonads and codescent objects. In Chapter 2 we recall all the necessary notions. In Chapter 3 we show that factorization systems can be…
The proposed article aims at offering a comprehensive tutorial for the computational aspects of structured matrix and tensor factorization. Unlike existing tutorials that mainly focus on {\it algorithmic procedures} for a small set of…
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…
In this paper the concept of compatible weak factorization systems in general categories is introduced as a counterpart of compatible complete cotorsion pairs in abelian categories. We describe a method to construct model structures on…
Partial Markov categories are a recent framework for categorical probability theory that provide an abstract account of partial probabilistic computation with updating semantics. In this article, we discuss two order relations on the…
When one studies the structure (e.g. graded ideals, graded subspaces, radicals, ...) or graded polynomial identities of graded algebras, the grading group itself does not play an important role, but can be replaced by any other group that…
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…
We relativise double categories of relations to stable orthogonal factorisation systems. Furthermore, we present the characterisation of the relative double categories of relations in two ways. The first utilises a generalised comprehension…
We study discrete opfibration classifiers in enhanced 2-categories and show how, under suitable hypotheses, such classifiers can be endowed with the structure of a (lax or pseudo-)T-algebra and classify strict discrete opfibrations in…