Related papers: Double Orthogonal Factorization Systems
In this paper we introduce a notion of duality for matrix valued orthogonal polynomials with respect to a measure supported on the nonnegative integers. We show that the dual families are closely related to certain difference operators…
In 2017, Bauer, Johnson, Osborne, Riehl, and Tebbe (BJORT) showed that the Abelian functor calculus provides an example of a Cartesian differential category. The definition of a Cartesian differential category is based on a differential…
In this paper we give a purely categorical construction of d-fold matrix factorizations of a natural transformation, for any even integer d. This recovers the classical definition of those for regular elements in commutative rings due to…
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
Algebraic weak factorisation systems (AWFS) refine weak factorisation systems by requiring that the assignations sending a map to its first and second factors should underlie an interacting comonad--monad pair on the arrow category. We…
In the context of categories equipped with a structure of nullhomotopies, we introduce the notion of homotopy torsion theory. As special cases, we recover pretorsion theories as well as torsion theories in multi-pointed categories and in…
The problem of linear equivalence for a general class of nonlinear systems, is examined throughout this paper. A relevant algorithm is developed, based on a factorization procedure. This factorization is based on the star-product, an…
A popular graphical calculus for monoidal categories makes computations tactile and intuitive. Complicated diagram chases can be expressed in a few pictures and discovered by playing with a shoelace. Joyal and Street's proof of the…
In this article we extend the theory of lax monoidal structures, also known as multitensors, and the monads on categories of enriched graphs that they give rise to. Our first principal result -- the lifting theorem for multitensors --…
We present an efficient and user-friendly method for constructing any cofibrantly generated model structure on the category of double categories whose trivial fibrations are the "canonical" ones: the double functors which are surjective on…
Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…
Multiple orthogonality is considered in the realm of a Gauss--Borel factorization problem for a semi-infinite moment matrix. Perfect combinations of weights and a finite Borel measure are constructed in terms of M-Nikishin systems. These…
In this paper we introduce a description of ordered groupoids as a particular type of double categories. This enables us to turn Lawson's correspondence between ordered groupoids and left-cancellative categories into a biequivalence. We use…
We introduce a general tensor model suitable for data analytic tasks for {\em heterogeneous} datasets, wherein there are joint low-rank structures within groups of observations, but also discriminative structures across different groups. To…
We study polynomial functors over locally cartesian closed categories. After setting up the basic theory, we show how polynomial functors assemble into a double category, in fact a framed bicategory. We show that the free monad on a…
We introduce large scale analogues of topological monotone and light maps, which we call coarsely monotone and coarsely light maps respectively. We show that these two classes of maps constitute a factorization system on the coarse…
We study limits in 2-categories whose objects are categories with extra structure and whose morphisms are functors preserving the structure only up to a coherent comparison map, which may or may not be required to be invertible. This is…
The goal of Boolean Matrix Factorization (BMF) is to approximate a given binary matrix as the product of two low-rank binary factor matrices, where the product of the factor matrices is computed under the Boolean algebra. While the problem…
We provide necessary and sufficient conditions for the Hessenberg recurrence matrix associated with a system of multiple orthogonal polynomials to admit a factorisation as a product of bidiagonal matrices. Using the Gauss-Borel…
Higher-order processes with parameterization are capable of abstraction and application (migrated from the lambda-calculus), and thus are computationally more expressive. For the minimal higher-order concurrency, it is well-known that the…