Related papers: Functorial aggregation
Multisorted modules, equivalently representations of quivers, equivalently additive functors on preadditive categories, encompass a wide variety of additive structures. In addition, every module has a natural and useful multisorted…
Category theory provides a collective description of many arrangements in mathematics, such as topological spaces, Banach spaces and game theory. Within this collective description, the perspective from any individual member of the…
We prove that any right Quillen functor between arbitrary model categories admits non trivial functorial factorizations that are similar to those of a model structure. We also prove that these factorizations can be made for lax monoidal…
We give a construction of triangulated categories as quotients of exact categories where the subclass of objects sent to zero is defined by a triple of functors. This includes the cases of homotopy and stable module categories. These…
We develop a theory of adjunctions in semigroup categories, i.e. monoidal categories without a unit object. We show that a rigid semigroup category is promonoidal, and thus one can naturally adjoin a unit object to it. This extends the…
The notion of the center of an algebra over a field k has a far reaching generalization to algebras in monoidal categories. The center then lives in the monoidal center of the original category. This generalization plays an important role…
Although multiplier bimonoids in general are not known to correspond to comonoids in any monoidal category, we classify them in terms of maps from the Catalan simplicial set to another suitable simplicial set; thus they can be regarded as…
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…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
Strong functors and monads are ubiquitous in Computer Science. More recently, comonads have demonstrated their use in structuring context-dependent notions of computation. However, the dualisation of ``being strong'' property passed somehow…
Some sorts of generalized morphisms are defined from very basic mathematical objects such as sets, functions, and partial functions. A wide range of mathematical notions such as continuous functions between topological spaces, ring…
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…
We introduce collages of string diagrams as a diagrammatic syntax for glueing multiple monoidal categories. Collages of string diagrams are interpreted as pointed bimodular profunctors. As the main examples of this technique, we introduce…
We investigate adjoint and Frobenius pairs between categories of comodules over rather general corings. We particularize to the case of the adjoint pair of functors associated to a morphism of corings over different base rings, which leads…
We show that several apparently unrelated formulas involving left or right Bousfield localizations in homotopy theory are induced by comparison maps associated with pairs of adjoint functors. Such comparison maps are used in the article to…
The functor that takes a ring to its category of modules has an adjoint if one remembers the forgetful functor to abelian groups: the endomorphism ring of linear natural transformations. This uses the self-enrichment of the category of…
There are various generalizations of bialgebras to their ''many object'' versions, such as quantum categories, bialgebroids and weak bialgebras. These can also be thought of as quantum analogues of small categories. In this paper we study…
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 instal homological algebra, including derived functors, on certain non-additive categories like categories of pointed CW-complexes, modules of monoids or sheaves thereof. We apply this theory to Monoid schemes and sheaves on them,…
In the category of monoids we characterize monomorphisms that are normal, in an appropriate sense, to internal reflexive relations, preorders or equivalence relations. The zero-classes of such internal relations are first described in terms…