Related papers: Extracting an $\mathbb{N}$-filtered differential m…
To any model category $\mathcal{M}$, we associate a modular model category, a functor of points $\mathcal{M}[-]:$ Cat $\rightarrow$ Cat, that associates to any small category $\mathcal{C}$ a functor category $\mathcal{M}[\mathcal{C}] =…
We present a method of constructing monoidal, braided monoidal, and symmetric monoidal bicategories from corresponding types of monoidal double categories that satisfy a lifting condition. Many important monoidal bicategories arise…
In terms of category theory, the Gromov homotopy principle for a set valued functor $F$ asserts that the functor $F$ can be induced from a homotopy functor. Similarly, we say that the bordism principle for an abelian group valued functor…
A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…
This lecture series is based on joint work in progress with Shaul Barkan, as well as work in progress of the author. The five sections of these notes correspond to the five lectures, but more details have been added. $2$-dimensional…
In the theory of coalgebras $C$ over a ring $R$, the rational functor relates the category of modules over the algebra $C^*$ (with convolution product) with the category of comodules over $C$. It is based on the pairing of the algebra $C^*$…
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…
Feature extraction is a key step in image processing for pattern recognition and machine learning processes. Its purpose lies in reducing the dimensionality of the input data through the computing of features which accurately describe the…
A filtration of the morphisms of the $k$-linearization $k \mathbf{FS}$ of the category $\mathbf{FS}$ of finite sets and surjections is constructed using a natural $k \mathbf{FI}^{op}$-module structure induced by restriction, where…
The aim of this paper is to develop a refinement of Forman's discrete Morse theory. To an acyclic partial matching $\mu$ on a finite regular CW complex $X$, Forman introduced a discrete analogue of gradient flows. Although Forman's gradient…
Given a right adjoint functor between triangulated categories and an object in the target category, we show that the unit map of adjunction on that object is a split monomorphism if and only if the object belongs to the additive closure of…
In this paper, we show another proof of the problem by constructing a strict monoidal category M(C) consisting of M-functors and M-morphisms of a category C and we prove C is equivalent to it. The proof is based on a basic character of…
This paper reviews a class of univariate piecewise polynomial functions known as discrete splines, which share properties analogous to the better-known class of spline functions, but where continuity in derivatives is replaced by (a…
We define a bar construction endofunctor on the category of commutative augmented monoids $A$ of a symmetric monoidal category $\mathcal{V}$ endowed with a left adjoint monoidal functor $F:s\mathbf{Set}\to \mathcal{V}$. To do this, we need…
We study monoidal profunctors as a tool to reason and structure pure functional programs both from a categorical perspective and as a Haskell implementation. From the categorical point of view we approach them as monoids in a certain…
A double category is constructed from a `fattened' version of a given category, motivated in part by a context of parallel transport. We also study monoidal structures on the underlying category and on the fattened category.
Parallel transport of a connection in a smooth fibre bundle yields a functor from the path groupoid of the base manifold into a category that describes the fibres of the bundle. We characterize functors obtained like this by two notions we…
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…
A supervised learning algorithm searches over a set of functions $A \to B$ parametrised by a space $P$ to find the best approximation to some ideal function $f\colon A \to B$. It does this by taking examples $(a,f(a)) \in A\times B$, and…
Firm Frobenius algebras are firm algebras and counital coalgebras such that the comultiplication is a bimodule map. They are investigated by categorical methods based on a study of adjunctions and lifted functors. Their categories of…