相关论文: Coherence of Proof-Net Categories

One version of Whitehead's famous cut vertex lemma says that if an element of a free group is part of a free basis, then a certain graph associated to its conjugacy class that we call the star graph is either disconnected or has a cut…

We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…

We introduce the notion of a definable category--a category equivalent to a full subcategory of a locally finitely presentable category that is closed under products, directed colimits and pure subobjects. Definable subcategories are…

We define a coherent adjunction in a strict $3$-category and we use string diagrams to show that any adjunction can be extended to a coherent adjunction in an essentially unique way.

Network models, which abstractly are given by lax symmetric monoidal functors, are used to construct operads for modeling and designing complex networks. Many common types of networks can be modeled with simple graphs with edges weighted by…

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Every smooth manifold contains particles which propagate. These form objects and morphisms of a category equipped with a functor to the category of Abelian groups, turning this into a 0+1 topological field theory. We investigate the…

We define a traced pseudomonoid as a pseudomonoid in a monoidal bicategory equipped with extra structure, giving a new characterisation of Cauchy complete traced monoidal categories as algebraic structures in Prof, the monoidal bicategory…

We prove that the homotopy theory of monoidal relative categories is equivalent to that of monoidal $\infty$-categories, and likewise in the symmetric monoidal setting. As an application, we give a concise and complete proof of the fact…

A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…

Polynomials in a category have been studied as a generalization of the traditional notion in mathematics. Their construction has recently been extended to higher groupoids, as formalized in homotopy type theory, by Finster, Mimram, Lucas…

We propose a categorical framework to reason about scientific explanations: descriptions of a phenomenon meant to translate it into simpler terms, or into a context that has been already understood. Our motivating examples come from systems…

We study the category whose objects are graphs of fixed genus and whose morphisms are contractions. We show that the corresponding contravariant module categories are Noetherian and we study two families of modules over these categories.…

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…

Linearly distributive categories (LDC), introduced by Cockett and Seely to model multiplicative linear logic, are categories equipped with two monoidal structures that interact via linear distributivities. A seminal result in monoidal…

For $n\in \mathbb{N}$, a group is called $n$-coherent if every subgroup of type $\mathsf{F}_n$ is of type $\mathsf{F}_{n+1}$. For $n\ge 1$, we observe that graphs of groups with $n$-coherent vertex groups and virtually poly-cyclic edge…

We give an alternative presentation of braided monoidal categories. Instead of the usual associativity and braiding we have just one constraint (the b-structure). In the unital case, the coherence conditions for a b-structure are shown to…

A moment category is endowed with a distinguished set of split idempotents, called moments, which can be transported along morphisms. Equivalently, a moment category is a category with an active/inert factorisation system fulfilling two…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

The study of abstraction and composition - the focus of category theory - naturally leads to sophisticated diagrams which can encode complex algebraic semantics. Consequently, these diagrams facilitate a clearer visual comprehension of…