Related papers: Presentations of diagram categories
We show that the homotopy colimit construction for diagrams of categories with an operad action, recently introduced by Fiedorowicz, Stelzer and Vogt, has the desired homotopy type for diagrams of weak braided monoidal categories. This…
We give a new type of Schur-Weyl duality for the representations of a family of quantum subgroups and their centralizer algebra. We define and classify singly-generated, Yang-Baxter relation planar algebras. We present the skein theoretic…
In this note, we investigate fundamental relations between exploration processes in random graphs, and branching processes. We formulate a class of models that we call {\em rank-$k$ random graphs}, and that are special in that their…
We propose the notion of association schemoids generalizing that of association schemes from small categorical points of view. In particular, a generalization of the Bose-Mesner algebra of an association scheme appears as a subalgebra in…
Linking diagrams with path composition are ubiquitous, for example: Temperley-Lieb and Brauer monoids, Kelly-Laplaza graphs for compact closed categories, and Girard's multiplicative proof nets. We construct the category Link=Span(iRel),…
We define the graph minor category and prove that the category of contravariant representations of the graph minor category over a Noetherian ring is locally Noetherian. This can be regarded as a categorification of the Robertson--Seymour…
We classify and construct all line graphs that are $3$-polytopes (planar and $3$-connected). Apart from a few special cases, they are all obtained starting from the medial graphs of cubic (i.e., $3$-regular) $3$-polytopes, by applying two…
Circuit algebras, used in the study of finite-type knot invariants, are a symmetric analogue of Jones's planar algebras. They are very closely related to circuit operads, which are a variation of modular operads admitting an extra monoidal…
We provide a combinatorial description of the monoidal category generated by the fundamental representation of the small quantum group of $\mathfrak{sl}_2$ at a root of unity $q$ of odd order. Our approach is diagrammatic, and it relies on…
We design a Rocq library about adhesive categories, using Hierarchy Builder (HB). It is built around two hierarchies. The first is for categories, with usual categories at the bottom and adhesive categories at the top, with weaker variants…
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…
A category structure for ordered Bratteli diagrams is proposed in which isomorphism coincides with the notion of equivalence of Herman, Putnam, and Skau. It is shown that the natural one-to-one correspondence between the category of Cantor…
We want to construct a homological link invariant whose Euler characteristic is MOY polynomial as Khovanov and Rozansky constructed a categorification of HOMFLY polynomial. The present paper gives the first step to construct a…
Categorical probability has recently seen significant advances through the formalism of Markov categories, within which several classical theorems have been proven in entirely abstract categorical terms. Closely related to Markov categories…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
We classify the automorphic representations (over number fields) and the irreducible admissible representations (over local fields) of unitary groups which are not quasi-split, under the assumption that the same is known for quasi-split…
We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of…
We review the linearization of Poisson brackets and related problems, in the formal, analytic and smooth categories.
We study semantic models of probabilistic programming languages over graphs, and establish a connection to graphons from graph theory and combinatorics. We show that every well-behaved equational theory for our graph probabilistic…
In the paper we give a survey of rather new notions and results which generalize classical ones in the theory of braids. Among such notions are various inverse monoids of partial braids. We also observe presentations different from standard…