相关论文: Regular pairings of functors and weak (co)monads
As shown in a previous paper by the same authors, the theory of Galois functors provides a categorical framework for the characterisation of bimonads on any category as Hopf monads and also for the characterisation of opmonoidal monads on…
We define weak units in a semi-monoidal 2-category $\CC$ as cancellable pseudo-idempotents: they are pairs $(I,\alpha)$ where $I$ is an object such that tensoring with $I$ from either side constitutes a biequivalence of $\CC$, and $\alpha:…
Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute…
Batanin and Leinster's work on globular operads has provided one of many potential defnitions of a weak $\omega$-category. Through the language of globular operads they construct a monad whose algebras encode weak $\omega$-categories. The…
We show how the relatively initial or relatively terminal fixed points for a well-behaved functor $F$ form a pair of adjoint functors between $F$-coalgebras and $F$-algebras. We use the language of locally presentable categories to find…
Consider a coring with exact rational functor, and a finitely generated and projective right comodule. We construct a functor (\emph{coinduction functor}) which is right adjoint to the hom-functor represented by this comodule. Using the…
Categories can be identified -- up to isomorphism -- with polynomial comonads on Set. The left Kan extension of a functor along itself is always a comonad -- called the density comonad -- so it defines a category when its carrier is…
This paper considers the possible underlying multicategories for a symmetric monoidal category, and shows that, up to canonical and coherent isomorphism, there really is only one. As a result, there is a well-defined forgetful functor from…
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 define a weak bimonad as a monad T on a monoidal category M with the property that the Eilenberg-Moore category M^T is monoidal and the forgetful functor from M^T to M is separable Frobenius. Whenever M is also Cauchy complete, a simple…
We consider representations of quivers taking values in monads or comonads over a Grothendieck category $\mathcal C$. We treat these as scheme like objects whose ``structure sheaf'' consists of monads or comonads. By using systems of…
We introduce a new type of duality structure for $A_\infty$-categories called a relative weak Calabi-Yau pairing which generalizes Kontsevich and Soibelman's notion of a weak (proper) Calabi-Yau structure. We prove the existence of a…
Monads are a useful tool for structuring effectful features of computation such as state, non-determinism, and continuations. In the last decade, several generalisations of monads have been suggested which provide a more fine-grained model…
We investigate the extent to which the weak equivalences in a model category can be equipped with algebraic structure. We prove, for instance, that there exists a monad T such that a morphism of topological spaces admits T-algebra structure…
The behaviour of limits of weak morphisms in 2-dimensional universal algebra is not 2-categorical in that, to fully express the behaviour that occurs, one needs to be able to quantify over strict morphisms amongst the weaker kinds.…
Under appropriate conditions, if one picks a commutative algebra A with action of group G in braided monoidal category C, the category of A modules in C obtains a natural crossed G-braided structure. In the case of general commutative…
Associated to a simple root of a finite-dimensional complex semisimple Lie algebra, there are several endofunctors (defined by Arkhipov, Enright, Frenkel, Irving, Jantzen, Joseph, Mathieu, Vogan and Zuckerman) on the BGG category…
Strong bisimulation for labelled transition systems is one of the most fundamental equivalences in process algebra, and has been generalised to numerous classes of systems that exhibit richer transition behaviour. Nearly all of the ensuing…
We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…
We present the notion of "cyclic double multicategory", as a structure in which to organise multivariable adjunctions and mates. The classic example of a 2-variable adjunction is the hom/tensor/cotensor trio of functors; we generalise this…