Related papers: Hom-counting functions, combinatorial categories a…
This work presents an exposition of both the internal structure of derived category of an abelian category D*(A) and its contribution in solving problems, particularly in algebraic geometry. Calculation of some morphisms will be presented…
We state a Yoneda-type lemma which leads to various functor categories being compact closed.
We show that, for a right exact functor from an abelian category to abelian groups, Yoneda's isomorphism commutes with homology and, hence, with functor derivation. Then we extend this result to semiabelian domains. An interpretation in…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
Everyone knows that if you have a bivariant homology theory satisfying a base change formula, you get an representation of a category of correspondences. For theories in which the covariant and contravariant transfer maps are in mutual…
Yoneda'e Lemma is about the canonical isomorphism of all the natural transformations from a given representable covariant (contravariant, reps.) functor (from a locally small category to the category of sets) to a covariant (contravariant,…
We generalise to a group homomorphism $\tau$ the $\chi$-graded categories of S\"{o}zer and Virelizier. These are categories in which both morphisms and objects have compatible degrees. We give a 'half-enriched' Yoneda lemma, a structure…
In this paper Hom-Lie algebras, Lie color algebras, Lie superalgebras and other type of generalized Lie algebras are recovered by means of an iterated construction, known as monadic decomposition of functors, which is based on…
Category theory has foundational importance because it provides conceptual lenses to characterize what is important in mathematics. Originally the main lenses were universal mapping properties and natural transformations. In recent decades,…
We explain the use of category theory in describing certain sorts of anyons. Yoneda's lemma leads to a simplification of that description. For the particular case of Fibonacci anyons, we also exhibit some calculations that seem to be known…
In this paper we explore a family of type isomorphisms in System F whose validity corresponds, semantically, to some form of the Yoneda isomorphism from category theory. These isomorphisms hold under theories of equivalence stronger than…
This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
A model category is called combinatorial if it is cofibrantly generated and its underlying category is locally presentable. As shown in recent years, homotopy categories of combinatorial model categories share useful properties, such as…
Game comonads have brought forth a new approach to studying finite model theory categorically. By representing model comparison games semantically as comonads, they allow important logical and combinatorial properties to be exressed in…
We construct relative abelian categories in the sense of MacLane for models of algebraic systems in (co)complete abelian categories. As an example, we consider an analogue of Hochschild-Mitchell cohomology for the functor of Yoneda…
The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…
Type isomorphism is useful for retrieving library components, since a function in a library can have a type different from, but isomorphic to, the one expected by the user. Moreover type isomorphism gives for free the coercion required to…
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…