Related papers: Rewriting modulo isotopies in pivotal linear $(2,2…
We study a presentation of Khovanov - Lauda - Rouquier's candidate $2$-categorification of a quantum group using algebraic rewriting methods. We use a computational approach based on rewriting modulo the isotopy axioms of its pivotal…
In this paper, we introduce a rewriting theory of linear monoidal categories. Those categories are a particular case of what we will define as linear (n, p)-categories. We will also define linear (n, p)-polygraphs, a linear adapation of…
We develop a rewriting theory suitable for diagrammatic algebras and lay down the foundations of a systematic study of their higher structures. In this paper, we focus on the question of finding bases. As an application, we give the first…
A coherent presentation of an n-category is a presentation by generators, relations and relations among relations. Confluent and terminating rewriting systems generate coherent presentations, whose relations among relations are defined by…
String diagrams are a powerful and intuitive graphical syntax for terms of symmetric monoidal categories (SMCs). They find many applications in computer science and are becoming increasingly relevant in other fields such as physics and…
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating,…
We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius…
Convergent rewriting systems on algebraic structures give methods to solve decision problems, to prove coherence results, and to compute homological invariants. These methods are based on higher-dimensional extensions of the critical…
We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In a previous…
Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the…
String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the modelling of various computational structures, in fields as…
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…
String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is…
We provide an explicit and elementary construction of the Morita $(\infty,2)$-category of a monoidal category which satisfies minimal conditions. We construct it as a $3$-coskeletal $2$-complicial set, in which the vertices encode the…
Let $W$ be an affine Weyl group, and let $\Bbbk$ be a field of characteristic $p>0$. The diagrammatic Hecke category $\mathcal{D}$ for $W$ over $\Bbbk$ is a categorification of the Hecke algebra for $W$ with rich connections to modular…
We compute the elliptic genera of two-dimensional N=(2,2) and N=(0,2) gauged linear sigma models via supersymmetric localization, for rank-one gauge groups. The elliptic genus is expressed as a sum over residues of a meromorphic function…
We revisit Kapranov and Voevodsky's idea of spaces modelled on combinatorial pasting diagrams, now as a framework for higher-dimensional rewriting and the basis of a model of weak omega-categories. In the first part, we elaborate on…
In this paper, we explore a connection between binary hierarchical models, their marginal polytopes and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is…
A symmetric monoidal category is a category equipped with an associative and commutative (binary) product and an object which is the unit for the product. In fact, those properties only hold up to natural isomorphisms which satisfy some…
Renormalization-group methods in soft-collinear effective theory are used to perform the resummation of large perturbative logarithms for deep-inelastic scattering in the threshold region x->1. The factorization theorem for the structure…