Related papers: Equivalence of Applicative Functors and Multifunct…

We prove an adjoint functor theorem in the setting of categories enriched in a monoidal model category $\mathcal V$ admitting certain limits. When $\mathcal V$ is equipped with the trivial model structure this recaptures the enriched…

Let $G$ be a finite group. In this paper, we first introduce a new notion, so-called the Mackey double category of $G$. Then we prove that the category of Mackey double categories and the category of Mackey functors of $G$ are equivalent.

Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…

We introduce separable functors of the second kind (or $H$-separable functors) and $H$-Maschke functors. $H$-separable functors are generalizations of separable functors. Various necessary and sufficient conditions for a functor to be…

We prove a classification of additive polynomial superfunctors, which allows us to compute some extensions of a superfunctor of the form $F \circ A$ where $F$ is a classical polynomial functor and $A$ is additive. We get a formula which…

We associate to a bimonoidal functor, i.e. a bifunctor which is monoidal in each variable, a nonabelian version of a biextension. We show that such a biextension satisfies additional triviality conditions which make it a bilinear analog of…

We prove a class of equivalences of additive functor categories that are relevant to enumerative combinatorics, representation theory, and homotopy theory. Let $\mathscr{X}$ denote an additive category with finite direct sums and split…

A Quillen model structure is presented by an interacting pair of weak factorization systems. We prove that in the world of locally presentable categories, any weak factorization system with accessible functorial factorizations can be lifted…

We study polynomial comonads and polynomial bicomodules. Polynomial comonads amount to categories. Polynomial bicomodules between categories amount to parametric right adjoint functors between corresponding copresheaf categories. These may…

We explore an alternative definition of unit in a monoidal category originally due to Saavedra: a Saavedra unit is a cancellative idempotent (in a 1-categorical sense). This notion is more economical than the usual notion in terms of…

One goal of applied category theory is to better understand networks appearing throughout science and engineering. Here we introduce "structured cospans" as a way to study networks with inputs and outputs. Given a functor $L \colon…

Let $\mathcal{C}$ be an additive category. The nilpotent category $\mathrm{Nil} (\mathcal{C})$ of $\mathcal{C}$, consists of objects pairs $(X, x)$ with $X\in\mathcal{C}, x\in\mathrm{End}_{\mathcal{C}}(X)$ such that $x^n=0$ for some…

Ability to use definitions occurring in the code directly in equational reasoning is one of the key strengths of functional programming. This is impossible in the case of Haskell type class methods unless a particular instance type is…

Operads may be represented as symmetric monoidal functors on a small symmetric monoidal category. We discuss the axioms which must be imposed on a symmetric monoidal functor in order that it give rise to a theory similar to the theory of…

There are two dual equivalences between the $\infty$-category of $\mathcal{O}$-monoidal $\infty$-categories with right adjoint lax $\mathcal{O}$-monoidal functors and that with left adjoint oplax $\mathcal{O}$-monoidal functors, where…

We define a unified categorical framework for studying six subproblems arising from the classical Four Subspace Problem. For each subproblem, we construct a functor from its associated category to the category of representations of the…

We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…

A theory of a derivator version of six-functor-formalisms is developed, using an extension of the notion of fibered multiderivator due to the author. Using the language of (op)fibrations of 2-multicategories this has (like a usual fibered…

In this paper, we investigate diagrams, namely functors from any small category to a fixed category, and more particularly, their bisimilarity. Initially defined using the theory of open maps of Joyal et al., we prove several equivalent…

Push/enter and eval/apply are two calling conventions used in implementations of functional languages. In this paper, we explore the following observation: when considering functions with multiple arguments, the stack under the push/enter…