Related papers: Decreasing diagrams and coherent presentations

This is an introduction to the group algebras of the symmetric groups, written for a quarter-long graduate course. After recalling the definition of group algebras (and monoid algebras) in general, as well as basic properties of…

We study convergent (terminating and confluent) presentations of n-categories. Using the notion of polygraph (or computad), we introduce the homotopical property of finite derivation type for n-categories, generalizing the one introduced by…

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…

The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously…

We study the summands of the decomposition theorem for the Hitchin system for $\mathrm{GL}_n$, in arbitrary degree, over the locus of reduced spectral curves. A key ingredient is a new correspondence between these summands and the topology…

This work is about diagrammatic languages, how they can be represented, and what they in turn can be used to represent. More specifically, it focuses on representations and applications of string diagrams. String diagrams are used to…

We study the representation theory of the increasing monoid. Our results provide a fairly comprehensive picture of the representation category: for example, we describe the Grothendieck group (including the effective cone), classify…

A bicategory approach to differential cohomology is presented. Based on the axioms of Bunke-Schick, a symmetric monoidal groupoid is associated to differential refinements of cohomology theories. It is proven that such differential…

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…

With each antiholomorphic involution $\sigma $ of a connected complex semisimple Lie group $G$ we associate an automorphism $\epsilon_\sigma$ of the Dynkin diagram. The definition of $\epsilon_\sigma$ is given in terms of the Satake diagram…

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…

We define a new category analogous to ${\bf FI}$ for the $0$-Hecke algebra $H_n(0)$ called the $0$-Hecke category, $\mathcal{H}$, indexing sequences of representations of $H_n(0)$ as $n$ varies under suitable compatibility conditions. We…

Equality saturation, a technique for program optimisation and reasoning, has gained attention due to the resurgence of equality graphs (e-graphs). E-graphs represent equivalence classes of terms under rewrite rules, enabling simultaneous…

Let $0<k\in\mathbb{Z}$. A reinterpretation of the proof of existence of Hamilton cycles in the middle-levels graph $M_k$ induced by the vertices of the $(2k+1)$-cube representing the $k$- and $(k+1)$-subsets of $\{0,\ldots,2k\}$ is given…

This paper shows how to construct coherent presentations (presentations by generators, relations and relations among relations) of monoids admitting a right-noetherian Garside family. Thereby, it resolves the question of finding a unifying…

Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…

The idea of reduction of couplings consists in the search for relations between seemingly independent couplings of a renormalizable theory that are renormalization group invariant. In this article, we demonstrate the existence of such…

We introduce a new type of diagrams and prove the existence of a particular one, the "central tuned diagram", with some optimal features, for finitely generated modules of certain categories. This is achieved by getting to the idea of "the…

We show that in a weak globular $\omega$-category, all composition operations are equivalent and commutative for cells with sufficiently degenerate boundary, which can be considered a higher-dimensional generalisation of the Eckmann-Hilton…

A given monoid usually admits many presentations by generators and relations and the notion of Tietze equivalence characterizes when two presentations describe the same monoid: it is the case when one can transform one presentation into the…