Related papers: Rewriting modulo isotopies in pivotal linear $(2,2…
Convergent rewriting systems are well-known tools in the study of the word-rewriting problem. In particular, a presentation of a monoid by a finite convergent rewriting system gives an algorithm to decide the word problem for this monoid.…
Presentations of groups by rewriting systems (that is, by monoid presentations), have been fruitfully studied by encoding the rewriting system in a $2$--complex -- the Squier complex -- whose fundamental groupoid then describes the…
Building on work by Fiore-Pronk-Paoli, we construct four model structures on the category of double categories, each modeling one of the following: simplicial spaces, Segal spaces, $(\infty,1)$-categories, and $\infty$-groupoids.…
We introduce two applications of polygraphs to categorification problems. We compute first, from a coherent presentation of an $n$-category, a coherent presentation of its Karoubi envelope. For this, we extend the construction of Karoubi…
We develop a theory of rewriting for structured cospans in order to extend compositional methods for modeling open networks. First, we introduce a category whose objects are structured cospans, and establish conditions under which it is…
In this paper, we develop 2-dimensional algebraic theory which closely follows the classical theory of modules. The main results are giving definitions of 2-module and the representation of 2-ring. Moreover, for a 2-ring $\cR$, we prove…
We develop the rewriting theory for monoidal supercategories and 2-supercategories. This extends the theory of higher-dimensional rewriting established for (linear) 2-categories to the super setting, providing a suite of tools for…
Over the recent years, the theory of rewriting has been used and extended in order to provide systematic techniques to show coherence results for strict higher categories. Here, we investigate a further generalization to Gray categories,…
We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…
A series of works has established rewriting as an essential tool in order to prove coherence properties of algebraic structures, such as MacLane's coherence theorem for monoidal categories, based on the observation that, under reasonable…
We begin by defining Temperley-Lieb algebra, in two different ways: as a presented algebra or as a diagrammatic algebra. Next, we look for a basis algorithmically, using rewriting theory. Finally, we introduce a generalization of the…
We present a computational implementation of diagrammatic sets, a model of higher-dimensional diagram rewriting that is "topologically sound": diagrams admit a functorial interpretation as homotopies in cell complexes. This has potential…
The $\lambda$$\Pi$-calculus modulo theory is an extension of simply typed $\lambda$-calculus with dependent types and user-defined rewrite rules. We show that it is possible to replace the rewrite rules of a theory of the…
We propose a modal logic tailored to describe graph transformations and discuss some of its properties. We focus on a particular class of graphs called termgraphs. They are first-order terms augmented with sharing and cycles. Termgraphs…
We describe a diagrammatic procedure which lifts strict monoidal actions from additive categories to categories of complexes avoiding any use of direct sums. As an application, we prove that every simple transitive $2$-representation of the…
We prove Eilenberg-Watts Theorem for 2-categories of the representation categories $\C\x\Mod$ of finite tensor categories $\C$. For a consequence we obtain that any autoequivalence of $\C\x\Mod$ is given by tensoring with a representative…
In this paper, Whittaker modules for the W-algebra W(2,2) are studied. We obtain analogues to several results from the classical setting and the case of the Virasoro algebra, including a classification of simple Whittaker modules by central…
We start with observing that the only connected finite dimensional algebras with finitely many isomorphism classes of indecomposable bimodules are the quotients of the path algebras of uniformly oriented $A_n$-quivers modulo the radical…
In this paper we adapt previous work on rewriting string diagrams using hypergraphs to the case where the underlying category has a traced comonoid structure, in which wires can be forked and the outputs of a morphism can be connected to…
We give explicit recursive constructions for the polytope of all matroids $\Omega_{r,n}$ in ranks 2 and 3 for all ground set sizes. This polytope was introduced in recent work by Ferroni and Fink as a tool for checking positivity…