Related papers: Coherence for plactic monoids via rewriting theory…
Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…
We present an algorithmic approach to the conjugacy problems in monoids and semigroups, using rewriting systems. There is a class of monoids and semigroups that satisfy the condition that the transposi- tion problem and the left and right…
The cyclic shift graph of a monoid is the graph whose vertices are the elements of the monoid and whose edges connect elements that are cyclic shift related. The Patience Sorting algorithm admits two generalizations to words, from which two…
Presentations for unbraided, braided and symmetric pseudomonoids are defined. Biequivalences characterising the semistrict bicategories generated by these presentations are proven. It is shown that these biequivalences categorify results in…
We present Metatheory, a comprehensive library for programming language foundations in Lean 4. The library features a modular framework for proving confluence of abstract rewriting systems using three classical proof techniques: the diamond…
An algorithm for determining crystal structures from diffraction data is described which does not rely on the usual Fourier-space formulations of atomicity. The new algorithm implements atomicity constraints in real-space, as well as…
We consider quivers/skew-symmetric matrices under the action of mutation (in the cluster algebra sense). We classify those which are isomorphic to their own mutation via a cycle permuting all the vertices, and give families of quivers which…
We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof…
Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an…
These are notes for a lecture series given at the Fields Institute Summer School in Geometric Representation Theory and Extended Affine Lie Algebras, held at the University of Ottawa in June 2009. We give an introduction to the geometric…
We define term rewriting systems on the vertices and faces of nestohedra, and show that the former are confluent and terminating. While the associated posets on vertices generalize Barnard--McConville's flip order for graph-associahedra,…
De novo crystal generation, a central task in materials discovery, aims to generate crystals that are simultaneously valid, stable, unique, and novel. Existing methods mainly rely on black-box stochastic sampling, providing limited control…
We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…
By studying scattering Lie groups and their associated Lie algebras, we introduce a new method for the characterisation of collision invariants for physical scattering families associated to smooth, convex hard particles in the particular…
The symmetric Grothendieck polynomials representing Schubert classes in the $K$-theory of Grassmannians are generating functions for semistandard set-valued tableaux. We construct a type $A_n$ crystal structure on these tableaux. This…
Representation theorems for formal systems often take the form of an inductive translation that satisfies certain invariants, which are proved inductively. Theory morphisms and logical relations are common patterns of such inductive…
This article describes the *Confluence Framework*, a novel framework for proving and disproving confluence using a divide-and-conquer modular strategy, and its implementation in CONFident. Using this approach, we are able to automatically…
Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…
We introduce homotopical methods based on rewriting on higher-dimensional categories to prove coherence results in categories with an algebraic structure. We express the coherence problem for (symmetric) monoidal categories as an…
We study C*-algebras generated by left regular representations of right LCM one-relator monoids and Artin-Tits monoids of finite type. We obtain structural results concerning nuclearity, ideal structure and pure infiniteness. Moreover, we…