Related papers: Monadic vs Adjoint Decomposition

We study dualities between Lie algebras and Lie coalgebras, and their respective (co)representations. To allow a study of dualities in an infinite-dimensional setting, we introduce the notions of Lie monads and Lie comonads, as special…

We apply the notion of relative adjoint functor to generalise closed monoidal categories. We define representations in such categories and give their relation with left actions of monoids. The translation of these representations under lax…

We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar…

In this paper we explain the relationship between Frobenius objects in monoidal categories and adjunctions in 2-categories. In particular, we show that every Frobenius object in a monoidal category M arises from an ambijunction…

Contemporary large models often exhibit behaviors suggesting the presence of low-level primitives that compose into modules with richer functionality, but these fundamental building blocks remain poorly understood. We investigate this…

This paper describes several cases of adjunction in the homomorphism preorder of relational structures. We say that two functors $\Lambda$ and $\Gamma$ between thin categories of relational structures are adjoint if for all structures…

The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…

Conceiving of premises as collected into sets or multisets, instead of sequences, may lead to triviality for classical and intuitionistic logic in general proof theory, where we investigate identity of deductions. Any two deductions with…

This paper uses monads and comonads to establish a certain type of equivalence between two subcategories, one reflective and one coreflective, in a category whose objects represent compactifications of non-compact locally compact Hausdorff…

Let E be a (right) Hilbert C*-module over a C*-algebra A. If E is equipped with a left action of a second C*-algebra B, then tensor product with E gives rise to a functor from the category of Hilbert B-modules to the category of Hilbert…

Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…

Adjoint functors and projectivization in representation theory of partially ordered sets are used to generalize the algorithms of differentiation by a maximal and by a minimal point. Conceptual explanations are given for the combinatorial…

There are many contexts in algebraic geometry, algebraic topology, and homological algebra where one encounters a functor that has both a left and right adjoint, with the right adjoint being isomorphic to a shift of the left adjoint…

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

This is the introductory chapter of my PhD Thesis. This thesis consists of one introductory chapter and four single-authored papers written during my PhD studies at the University of Coimbra under supervision of Maria Manuel Clementino. In…

We establish a general method for generating reflections between categories. We then apply our technique to generate adjunctions starting from geometric morphisms between Grothendieck toposes; as particular cases, we recover various…

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…

The delay monad provides a way to introduce general recursion in type theory. To write programs that use a wide range of computational effects directly in type theory, we need to combine the delay monad with the monads of these effects.…

We introduce, comment and develop the Scott adjunction, mostly from the point of view of a category theorist. Besides its technical and conceptual aspects, in a nutshell we provide a categorification of the Scott topology over a posets with…

For an adjoint pair $(F, G)$ of functors, we prove that $G$ is a separable functor if and only if the defined monad is separable and the associated comparison functor is an equivalence up to retracts. In this case, under an idempotent…