相关论文: Rewriting in higher dimensional linear categories …

With a view on applications in computing, in particular concurrency theory and higher-dimensional rewriting, we develop notions of $n$-fold monoid and comonoid objects in $n$-fold monoidal categories and bicategories. We present a series of…

This paper introduces monoidal (super)categories resembling the Brauer category. For all categories, we can construct bases of the hom-spaces using Brauer diagrams. These categories include the Brauer category, its deformation the…

We give the definition of presentations of linear monoidal categories. Our main result is that given a presentation of a linear monoidal category, we can produce a presentation of the same category as a linear category. We apply this result…

The structure of monoidal categories in which every arrow is invertible is analyzed in this paper, where we develop a 3-dimensional Schreier-Grothendieck theory of non-abelian factor sets for their classification. In particular, we state…

This paper introduces the concept of distorted monoidal categories, a generalization of monoidal and braided monoidal categories that supports non-reversible and direction-sensitive tensor structures. Unlike the classical setting, where the…

Adhesive categories provide an abstract framework for the algebraic approach to rewriting theory, where many general results can be recast and uniformly proved. However, checking that a model satisfies the adhesivity properties is sometimes…

String diagrams are pictorial representations for morphisms of symmetric monoidal categories. They constitute an intuitive and expressive graphical syntax, which has found application in a very diverse range of fields including concurrency…

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…

Classical diagram categories and monoids, including the Temperley--Lieb, Brauer, and partition cases, arise as special instances of the category of two dimensional cobordisms and admit additional twists that produce a large new family of…

In this paper we introduce a strict monoidal subcategory of the category of matrices, suitable to address a higher representation theoretic analogue of radicals (non-semisimplicity) in ordinary representation theory. We show the extent to…

We examine a variant of hypergraphs that we call interfaced linear hypergraphs, with the aim of creating a sound and complete graphical language for symmetric traced monoidal categories (STMCs) suitable for graph rewriting. In particular,…

We introduce and study several affine (=annular in this paper) versions of the classical diagram algebras such as Temperley-Lieb, partition, Brauer, Motzkin, rook Brauer, rook, planar partition, and planar rook algebras. We give generators…

This paper clarifies basic definitions in the universal construction of topological theories and monoidal categories. The definition of the universal construction is given for various types of monoidal categories, including rigid and…

We generalize the notion of identities among relations, well known for presentations of groups, to presentations of n-categories by polygraphs. To each polygraph, we associate a track n-category, generalizing the notion of crossed module…

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…

Let $n,p,r$ be positive integers with $n \geq p\geq r$. A rank-$\overline{r}$ subset of $n$ by $p$ matrices (with entries in a field) is a subset in which every matrix has rank less than or equal to $r$. A classical theorem of Flanders…

For the whole class of linear term rewriting systems, we define \emph{bottom-up rewriting} which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting effectively inverse-preserves recognizability and analyze…

The structure of a $k$-fold monoidal category as introduced by Balteanu, Fiedorowicz, Schw\"anzl and Vogt can be seen as a weaker structure than a symmetric or even braided monoidal category. In this paper we show that it is still…

Using crossed homomorphisms, we show that the category of weak representations (resp. admissible representations) of Lie-Rinehart algebras (resp. Leibniz pairs) is a left module category over the monoidal category of representations of Lie…

This paper, written in 1998, aims to clarify various higher categorical structures, mostly through the theory of generalized operads and multicategories. Chapters I and II, which cover this theory and its application to give a definition of…