Related papers: Multifraction reduction II: Conjectures for Artin-…

We describe a new approach to the Word Problem for Artin-Tits groups and, more generally, for the enveloping group U(M) of a monoid M in which any two elements admit a greatest common divisor. The method relies on a rewrite system R(M) that…

We investigate the padded version of reduction, an extension of multifraction reduction as defined in arXiv:1606.08991, and connect it both with ordinary reduction and with the so-called Property $\mathrm{H}$. As an application, we show…

We investigate gcd-monoids, which are cancellative monoids in which any two elements admit a left and a right gcd, and the associated reduction of multifractions (arXiv:1606.08991 and 1606.08995), a general approach to the word problem for…

A conjecture of Dehornoy claims that, given a presentation of an Artin-Tits group, every word that represents the identity can be transformed into the trivial word using the braid relations, together with certain rules (between pairs of…

We conjecture that the word problem of Artin-Tits groups can be solved without introducing trivial factors ss^{-1} or s^{-1}s. Here we make this statement precise and explain how it can be seen as a weak form of hyperbolicity. We prove the…

We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good cases, the method provides a powerful tool for investigating…

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

We reduce a strong version of the twist conjecture for Artin groups to Artin groups whose defining graphs have no separating vertices. This produces new examples of Artin groups satisfying the conjecture, and sheds more light on the…

In this paper, a connection between rewriting systems and embedding of monoids in groups is found. We show that if a group with a positive presentation has a complete rewriting system $\Re$ that satisfies the condition that each rule in…

We give a necessary and sufficient condition on a visual splitting of an Artin group satisfying the conditions of two well known conjectures to be acylindrical, and demonstrate how this can be used to provide a large class of novel examples…

We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful for more general rewrite systems. These tools consist in introducing a…

Dual presentations of Coxeter groups have recently led to breakthroughs in our understanding of affine Artin groups. In particular, they led to the proof of the $K(\pi, 1)$ conjecture and to the solution of the word problem. Will the "dual…

A partial monoid $P$ is a set with a partial multiplication $\times$ (and total identity $1_P$) which satisfies some associativity axiom. The partial monoid $P$ may be embedded in a free monoid $P^*$ and the product $\star$ is simulated by…

A number of properties of spherical Artin groups extend to Garside groups, defined as the groups of fractions of monoids where least common multiples exist, there is no nontrivial unit, and some additional finiteness conditions are…

A subset $S$ of an integral domain $R$ is called a semidomain if the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities; additionally, we say that $S$ is additively reduced provided that $S$ contains no additive inverses. Given…

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 show thatthe double reversing algorithm proposed by dehornoy for solving the word problem in the braid group can also be used to recognize the conjugates of powers of the generators in an Artin group of spherical type. The proof uses a…

We prove a structure result on proper extensions of two-sided restriction semigroups in terms of partial actions, generalizing respective results for monoids and for inverse semigroups and upgrading the latter. We introduce and study…

We establish a criterion that implies the acylindrical hyperbolicity of many Artin groups admitting a visual splitting. This gives a variety of new examples of acylindrically hyperbolic Artin groups, including many Artin groups of FC-type.…

The cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In…