Related papers: Coherence for adjunctions in a $3$-category via st…
A notion of a coring extension is defined and it is related to the existence of an additive functor between comodule categories that factorises through forgetful functors. This correspondence between coring extensions and factorisable…
This paper develops a systematic framework for integrating local categories that model logical connectives using higher category theory. By extending these local categories into a unified two-category enriched with natural isomorphisms, the…
This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also to physicists, computer scientists, and…
By a conformal string in Euclidean space is meant a closed critical curve with non-constant conformal curvatures of the conformal arclength functional. We prove that (1) the set of conformal classes of conformal strings is in 1-1…
For a tensor triangulated category and any regular cardinal $\alpha$ we study the frame of $\alpha$-localizing tensor ideals and its associated space of points. For a well-generated category and its frame of localizing tensor ideals we…
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…
For each recollement of triangulated categories, there is an epivalence between the middle category and the comma category associated to a triangle functor from the category on the right to the category on the left. For a morphic…
We prove a stronger version of the octahedral axiom in a pre-triangulated category. The proof uses a new lemma about exact sequences in pointed additive categories which is based on a weak converse of the snake lemma.
Let $F:\mathcal{A}\to \mathcal{B}$ be a left adjoint between abelian categories and let $Ch(F)$ be the induced left adjoint on chain complexes. If the abelian categories $\mathcal{A}$ and $\mathcal{B}$ are equipped with sufficiently nice…
A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…
We develop a comprehensive string diagrammatic treatment of electrical circuits. Building on previous, limited case studies, we introduce controlled sources and meters as elements, and the impedance calculus, a powerful toolbox for…
A general algorithm is presented which gives a closed-form expression for an arbitrary perturbative diagram of cubic string field theory at any loop order. For any diagram, the resulting expression is given by an integral of a function of…
This paper investigates coherent-like conditions and related properties that a trivial extension might inherit from the ground ring over some classes of modules. It captures previous results dealing primarily with coherence, and also…
We consider notions of metrized categories, and then approximate categorical structures defined by a function of three variables generalizing the notion of $2$-metric space. We prove an embedding theorem giving sufficient conditions for an…
We survey some uses of adjoint functors in graph theory pertaining to colourings, complexity reductions, multiplicativity, circular colourings and tree duality. The exposition of these applications through adjoint functors unifies the…
We develop a bicategorical setup in which one can speak about adjoint 1-morphisms even in the absence of genuine identity 1-morphisms. We also investigate which part of 2-representation theory of 2-categories extends to this new setup.
In this paper, we present new concepts of Ann-categories, Ann-functors, and a transmission of the structure of categories based on Ann-equivalences. We build Ann-category of Pic-funtors and prove that each Ann-category can be faithfully…
We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…
Considering classical first-order logic with equality, we give a "fully syntactic" construction of the (weak) syntactic category $\text{Syn}(T)$ associated to a consistent theory $T$; we show it is a consistent coherent category; and we…
Like termination, confluence is a central property of rewrite systems. Unlike for termination, however, there exists no known complexity hierarchy for confluence. In this paper we investigate whether the decreasing diagrams technique can be…