Related papers: Closed categories
The concept of graph powers has been extensively studied in graph theory. Analogous to graph powers, Chandran et al. [3] introduced the notion of bipartite powers for bipartite graphs. In this paper, we show that the class of interval…
We define the concept of a regular object with respect to another object in an arbitrary category. We present basic properties of regular objects and we study this concept in the special cases of abelian categories and locally finitely…
We systematically develop the theory of definable functors between compactly generated triangulated categories. Such functors preserve pure triangles, pure injective objects, and definable subcategories, and as such appear in a wide range…
Given a braided pivotal category $\mathcal C$ and a pivotal module tensor category $\mathcal M$, we define a functor $\mathrm{Tr}_{\mathcal C}:\mathcal M \to \mathcal C$, called the associated categorified trace. By a result of…
We give a definition of a coherent adjunction in a $4$-category consisting of a finite list of $k$-morphisms for $k\leq 4$, plus equations beetween $4$-morphisms. We prove that the restriction map from the space of coherent adjunctions in a…
Diers developed a general theory of right multi-adjoint functors leading to a purely categorical, point-set construction of spectra. Situations of multiversal properties return sets of canonical solutions rather than a unique one. In the…
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…
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…
We study selfadjoint functors acting on categories of finite dimensional modules over finite dimensional algebras with an emphasis on functors satisfying some polynomial relations. Selfadjoint functors satisfying several easy relations, in…
We revisit an old assertion due to Rouquier, characterizing the perfect complexes as bounded homological functors on the bounded complexes of coherent sheaves. The new results vastly generalize the old statement---first of all the ground…
We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…
Rewriting systems are often defined as binary relations over a given set of objects. This simple definition is used to describe various properties of rewriting such as termination, confluence, normal forms etc. In this paper, we introduce a…
An adjoint pair is a pair of densely defined linear operators $A, B$ on a Hilbert space such that $\langle Ax,y\rangle=\langle x,By\rangle$ for $x\in \cD(A), y \in \cD(B).$ We consider adjoint pairs for which $0$ is a regular point for both…
We generalize the correspondence between theories and monads with arities of arXiv:1101.3064 to $\infty$-categories. Additionally, we introduce the notion of complete theories that is unique to the $\infty$-categorical case and provide a…
Let C be a small category and G be a tensor Grothendieck category. We define a notion of atness in the category Fun(C; G) of all covariant functors from C to G and show that the inclusion K(FlatA) ---> K(A) has a right adjoint where K(A) is…
We consider discrete metric spaces and we look for non-constant contractions. We introduce the notion of contractive map and we characterize the spaces with non-constant contractive maps. We provide some examples to discussion the possible…
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…
A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…
We introduce the theory of biset functors defined on finite categories. Previously, biset functors have been defined on groups, and in that context they are closely related to Mackey functors. Standard examples on groups include…
What is ergonomic syntax for relations? In this first paper in a series of two, to answer the question we define regular calculi: a suitably structured functor from a category representing the syntax of regular logic to the category of…