Related papers: Decreasing diagrams and coherent presentations

We describe a presentation for the descent algebra of the symmetric group $\sym{n}$ as a quiver with relations. This presentation arises from a new construction of the descent algebra as a homomorphic image of an algebra of forests of…

Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by…

In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair steps are relatively terminating with respect to R. We further…

We relate character theory of the symmetric groups $S_{2n}$ and $S_{2n+1}$ with that of the hyperoctahedral group $B_n = ({\mathbb Z}/2)^n \rtimes S_n$, as part of the expectation that the character theory of reductive groups with diagram…

The data for many useful bidirectional constructions in applied category theory (optics, learners, games, quantum combs) can be expressed in terms of diagrams containing "holes" or "incomplete parts", sometimes known as comb diagrams. We…

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…

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,…

A 0-Hecke algebra is a deformation of the group algebra of a Coxeter group. Based on work of Norton and Krob--Thibon, we introduce a tableau approach to the representation theory of 0-Hecke algebras of type A, which resembles the classic…

The new approach to the theory of complex representrations of the finite symmetric groups which based on the notions of Coxeter generators., Gelfand-Zetlin algebras, Hecke algebra, Young-Jucys-Murphi generators and which hardly used…

Compactifications of the heterotic string are a viable route to phenomenologically realistic vacua and interesting new mathematics. While supergravity aspects of heterotic compactifications are largely well-understood their worldsheet…

We introduce two 2-categories which categorify the monodromic Hecke algebra. The first is algebraic in nature and generalizes Abe's theory of Soergel bimodules. The second is a diagrammatic category defined via generators and relations…

Let W be a finite Coxeter group. We define its Hecke-group algebra by gluing together appropriately its group algebra and its 0-Hecke algebra. We describe in detail this algebra (dimension, several bases, conjectural presentation,…

In this paper we give a version of Bergman's diamond lemma which applies to certain monoidal categories presented by generators and relations. In particular, it applies to: the Coxeter presentation of the symmetric groups, the quiver Hecke…

We prove the existence of a sequence of commutative diagrams generalizing existing results on the cohomology of the Borel-Serre boundary and well-rounded retract to the context of the well-tempered complex. Our main theorem provides a…

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…

In 1979, Norton showed that the representation theory of the 0-Hecke algebra admits a rich combinatorial description. Her constructions rely heavily on some triangularity property of the product, but do not use explicitly that the 0-Hecke…

Proofs of coherence in category theory, starting from Mac Lane's original proof of coherence for monoidal categories, are sometimes based on confluence techniques analogous to what one finds in the lambda calculus, or in term-rewriting…

We compute the homology of the matching complex $M(\Gamma)$, where $\Gamma$ is the complete hypergraph on $n\geq 2$ vertices, and analyse the $S_n$-representations carried by this homology. These results are achieved using standard…

A Lagrangian definition of a large family of (0,2) supersymmetric conformal field theories may be made by an appropriate gauge invariant combination of a gauged Wess-Zumino-Witten model, right-moving supersymmetry fermions, and left-moving…

We describe a formalism, using groupoids, for the study of rewriting for presentations of inverse monoids, that is based on the Squier complex construction for monoid presentations. We introduce the class of pseudoregular groupoids, an…