Yves Guiraud
email: yves.guiraud@pps.univ-paris-diderot.fr

Philippe Malbos
email: malbos@math.univ-lyon1.fr

Samuel Mimram
email: samuel.mimram@cea.fr

A Homotopical Completion Procedure with Applications to Coherence of Monoids

One of the most used algorithm in rewriting theory is the Knuth-Bendix completion procedure which starts from a terminating rewriting system and iteratively adds rules to it, trying to produce an equivalent convergent rewriting system. It is in particular used to study presentations of monoids, since normal forms of the rewriting system provide canonical representatives of words modulo the congruence generated by the rules. Here, we are interested in extending this procedure in order to retrieve information about the low-dimensional homotopy properties of a monoid. We therefore consider the notion of coherent presentation, which is a generalization of rewriting systems that keeps track of the cells generated by confluence diagrams. We extend the Knuth-Bendix completion procedure to this setting, resulting in a homotopical completion procedure. It is based on a generalization of Tietze transformations, which are operations that can be iteratively applied to relate any two presentations of the same monoid. We also explain how these transformations can be used to remove useless generators, rules, or confluence diagrams in a coherent presentation, thus leading to a homotopical reduction procedure. Finally, we apply these techniques to the study of some examples coming from representation theory, to compute minimal coherent presentations for them: braid, plactic and Chinese monoids.

Introduction

A monoid can be presented as the free monoid Σ * 1 on a set Σ 1 of generators quotiented by a congruence generated by a set of relations Σ 2 ⊆ Σ * 1 × Σ * 1 . This data, called a presentation of the monoid, can be quite useful since it can provide a small description of it, from which various invariants can be computed, such as the homology of the monoid. For instance, the commutative monoid N × N admits the presentation ⟨Σ 1 Σ 2 ⟩ = ⟨a, b ba = ab⟩ with two generators and one relation. A way to show this result is to orient the relation as ba ⇒ ab in order to obtain a string rewriting system. This rewriting system is easily checked to be terminating and confluent (there is no critical pair), and the normal forms are canonical representative of words modulo the congruence generated by the relation: here, normal forms are words of the form a m b n , which are in bijection with elements of the monoid N × N.

The Knuth-Bendix completion. This recipe for constructing presentations does not always work as easily. In particular, the rewriting system obtained by orienting arbitrarily the relations has no reason to be convergent (i.e. both terminating and confluent). However, it was observed by Knuth and Bendix [START_REF] Knuth | Simple word problems in universal algebras[END_REF] that by adding rules to the rewriting system, one can sometimes complete it into a finite convergent one. The procedure that they have formulated in order to perform this completion in good cases (the procedure is not guaranteed to terminate) is one of the most used tool in rewriting theory.

Tietze transformations.

The starting point of the present work is the following observation: the Knuth-Bendix procedure operates by iteratively adding new relations, and this operation is a particular case of Tietze transformation [START_REF] Tietze | Über die topologischen Invarianten mehrdimensionaler Mannigfaltigkeiten[END_REF]. These are basic operations that one can perform on a presentation, in such a way that they do not change the presented monoid, and one can always transform a presentation of a given monoid into another one by applying a series of such transformations; two presentations of the same monoid are thus called Tietze-equivalent. These transformations are of four kinds: add or remove a definable generator, and add or remove a derivable relation.

Adding generators. The Knuth-Bendix procedure only exploits one kind of transformations in order to complete a rewriting system: given a critical pair v f ⇐ u g ⇒ w it adds a rule h ∶ v ⇒ w (or its converse), which is derivable since h = f -1 ○ g; in particular, adding it does not change the monoid presented by the rewriting system. Could the procedure be improved by also adding new generators during completion? On the theoretical level, an affirmative answer has been brought by Kapur and Narendran [START_REF] Kapur | A finite Thue system with decidable word problem and without equivalent finite canonical system[END_REF] who considered the usual Artin presentation Σ of the monoid B + 3 of positive braids with 3 strands (with its alternative graphical representation on the right):

tst ρ ⇒ sts ρ ⇒
with s = and t =

They show that there exists no finite convergent string rewriting system, with the same generators s and t, that presents the monoid B + 3 . However, they consider the string rewriting system Υ with three generators s, t and a new generator a (standing for the product st) and two relations st ⇒ a and sts ⇒ tst. This rewriting system Υ is Tietze-equivalent to the rewriting system Σ, but applying the Knuth-Bendix completion procedure on it terminates, giving rise to the convergent rewriting system Υ ′ with s, t, a as generators, and rules (2)

Thus, adding a superfluous generator has made completion possible. The reason why the completed rewriting system Υ ′ is Tietze-equivalent to the original rewriting system Σ can be understood by considering its four confluent critical branchings:

The cell A ∶ (βa) ⇛ (sα)○γ witnesses the fact that rule γ is superfluous since γ = (sα) -1 ○(βa) and, similarly, the cell B proves that δ = (saβ) -1 ○ (γt) is superfluous. Finally, the rule β witnesses the fact that the generator a is superfluous (it is equivalent to st). We are left with the rule α where a has been substituted by st, i.e. ρ ∶ tst ⇒ sts in (1). As we will see, this example is far from being isolated, thus justifying the use of Tietze transformations as a central concept to study existing extensions and refinements of completion procedures, such as Pedersen's morphocompletion [START_REF] Pedersen | Morphocompletion for one-relation monoids[END_REF], or to introduce new ones.

A homotopical completion procedure. The four diagrams in (3) are the generators of an equivalence relation between rewriting paths: two paths with the same source and the same target are equal up to those diagrams. The previous discussion shows the importance of keeping track of those higher-dimensional cells, which carry information about the rewriting system (for example, if one wants to compute invariants of monoids such as homology groups). This motivates the use of a generalization of the notion of presentation, called coherent presentation, which takes in account the higher-dimensional information contained in homotopy generators (the diagrams in (3)), and of a generalization of the notion of Tietze transformation to this setting. The homotopical completion procedure extends the Knuth-Bendix procedure into a tool for computing coherent presentations, by keeping track of homotopy generators created when adding new rules.

A homotopical reduction procedure. The additional information contained in coherent presentations can also help one to reduce a presentation by removing superfluous generators, rules and homotopy generators. For instance, we have already mentioned that the cell A in [START_REF] Cain | Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids[END_REF] indicates that the rule γ is superfluous. Similarly, the rule β indicates that the generator a is superfluous since it is equivalent to the product st, and we will see that superfluous homotopy generators in (3) can be also removed by computing critical triples of the rewriting system. All these operations of removing superfluous data from a presentation are again examples of Tietze transformations. Based on these, we introduce here a homotopical reduction procedure for coherent presentations which minimizes a coherent presentation, such as one obtained from our homotopical completion procedure. The general idea of this work is thus to give ways to mutate presentations using Tietze transformations in order to come up with presentations satisfying various properties: convergence, coherence, minimality, etc.

Coherent presentations to compute invariants of monoids. Minimal presentations obtained in this way exhibit invariants of the monoid, in the sense that even though constructed from a particular presentation of the monoid, their number of generators, rules and homotopy generators do not depend on the presentation, only on the monoid. In particular, when the monoid is presented by a finite convergent presentation, the corresponding coherent presentation always has a finite number of homotopy generators. This important result of Squier's theory [START_REF] Squier | The word problem for finitely presented monoids and finite canonical rewriting systems[END_REF][START_REF] Squier | Word problems and a homological finiteness condition for monoids[END_REF][START_REF] Squier | A finiteness condition for rewriting systems[END_REF], further studied in subsequent works [START_REF] Lafont | Church-Rosser property and homology of monoids[END_REF][START_REF] Lafont | A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)[END_REF][START_REF] Kobayashi | Complete rewriting systems and homology of monoid algebras[END_REF][START_REF] Guiraud | Higher-dimensional normalisation strategies for acyclicity[END_REF], has enabled him to construct a finitely presented decidable monoid with no finite convergent presentation: as a consequence, rewriting is not universal to decide the word problem in decidable monoids.

Applications in algebra and representation theory. Coherent presentations also appear as a fundamental structure in representation theory (in particular through the examples of Artin and plactic monoids). One of the motivations of the results presented here is to apply constructive rewriting methods to compute coherent presentations for these algebraic structures arising in geometry. For instance, Tits' theorem [START_REF] Tits | A local approach to buildings[END_REF] states that an Artin group has a coherent presentation where coherence cells are given by its parabolic subgroups of rank 3 (a similar result holds for Artin monoids). The original proof relies on geometry, we give here a constructive methodology that has since been used to obtain a coherent presentation for any Artin monoid and group [START_REF] Gaussent | Coherent presentations of Artin groups[END_REF]. We also apply our completion methods to the plactic monoid, used in the representation theory of semisimple Lie algebras [START_REF] Littelmann | A plactic algebra for semisimple Lie algebras[END_REF].

Contents of the paper. We introduce the notion of coherent presentation in Section 1, for which we formulate a homotopical completion-reduction procedure in Section 2, applied to various examples in Section 3. We should mention here that this works is part of a much larger general program aiming at studying the higher-dimensional properties of rewriting theory, see [START_REF] Guiraud | Higher-dimensional categories with finite derivation type[END_REF][START_REF] Guiraud | Coherence in monoidal track categories[END_REF][START_REF] Mimram | Computing Critical Pairs in 2-Dimensional Rewriting Systems[END_REF][START_REF] Guiraud | Identities among relations for higher-dimensional rewriting systems[END_REF][START_REF] Guiraud | Higher-dimensional normalisation strategies for acyclicity[END_REF][START_REF] Gaussent | Coherent presentations of Artin groups[END_REF] for example, based on Burroni's notion of polygraph [START_REF] Burroni | Higher-dimensional word problems with applications to equational logic. Theoret[END_REF].

R TA 1 Coherent presentations

The purpose of this section is to recall some classical material about rewriting systems and introduce some notions and notations from higher-dimensional rewriting. More details can be found in the mentioned references. In the following, we will assimilate the notion of string rewriting system to a presentation.

▸ Definition 1. A presentation Σ = (Σ 1 , Σ 2 ) consists of a set Σ 1 of generators and a set Σ 2 ⊆ Σ * 1 × Σ * 1 of rewriting rules.
It is finite if both sets Σ 1 and Σ 2 are finite. In the definition, Σ * 1 denotes the free monoid over Σ 1 (words over the alphabet Σ 1 ). We write ρ ∶ u ⇒ v for a rule ρ = (u, v) in Σ 2 . A word u rewrites to a word v, denoted by u ⇒ Σ v, when there exist words w 1 and w 2 and a rule ρ ∶ u ′ ⇒ v ′ such that u = w 1 u ′ w 2 and v = w 1 v ′ w 2 ; the corresponding rewriting step is then denoted by

w 1 ρw 2 ∶ u ⇒ v.
The reduction graph G Σ of a presentation Σ is the graph whose vertices are words and whose edges are rewriting steps. We write u ⇒ * Σ v when there exists a directed path from u to v in G Σ . A string rewriting system Σ is a presentation of a monoid M when M is isomorphic to the free monoid over Σ 1 quotiented by the congruence ⇔ * Σ generated by the relations in Σ 2 , i.e. u ⇔ * Σ v whenever there exists a non-directed path from u to v in G Σ . We write ⟨a 1 , . . . , a n u 1 ⇒ v 1 , . . . , u n ⇒ v n ⟩ for the monoid presented by the rewriting system Σ with Σ 1 = {a 1 , . . . , a n } and Σ

2 = {ρ 1 ∶ u 1 ⇒ v 1 , . . . , ρ n ∶ u n ⇒ v n }.

Coherent presentations of monoids

We extend the notion of presentation in order to incorporate an equivalence between paths which is described by a set of homotopy generators, in the same way that rewriting rules specify an equivalence between words. In order to do so, we first have to explicitly consider the rewriting paths (and not only the convertibility relation, i.e. whether there exists a path between two words), which leads us to define the category generated by a rewriting system. ▸ Definition 2. Let Σ be a presentation. The category Σ * 2 generated by Σ has the words in Σ * 1 as objects, and the directed paths in G Σ as morphisms, quotiented by the smallest congruence forgetting the order of rewriting steps at two disjoint positions, i.e. formally making the following diagrams commutative:

wu 2 w ′ v 1 w ′′ wu 2 w ′ σw ′′ ' / wu 1 w ′ v 1 w ′′ wρw ′ v 1 w ′′ B > wu 1 w ′ σw ′′ 2 4 wu 2 w ′ v 2 w ′′ wu 1 w ′ v 2 w ′′ wρw ′ v 2 w ′′ H D for all ⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩ u 1 ρ ⇒ u 2 and v 1 σ ⇒ v 2 in Σ 2 w, w ′ and w ′′ in Σ * 1 .
Equivalence of rewriting at disjoint positions is justified by local confluence (orthogonal branchings are never obstructions to confluence) and corresponds on the categorical side to the exchange axiom of 2-categories. The groupoid Σ ⊺ 2 generated by the presentation Σ is the category defined similarly, with inverses added for each morphism: morphisms are non-directed paths in G Σ and we write f -1 ∶ v ⇒ u for a path f ∶ u ⇒ v taken backwards.

▸ Example 3. Consider the presentation Σ with Σ 1 = {s, t, a} as generators, and whose rules in Σ 2 are the four rules of (2). The following composite of rewriting steps is a morphism in Σ * 2 : (saγ) ○ (δa) ○ (aaα) ∶ sasas ⇒ aaas; it occurs in the border of the cell C in (3). Similarly, the composite (sα) ○ γ ○ (βa) -1 ∶ sta ⇒ sta is a morphism in the groupoid Σ ⊺ 2 , which is the border of the cell A in (3).

Given a morphism f ∶ u ⇒ v and words w 1 , w 2 in Σ * 1 , we write w 1 f w 2 ∶ w 1 uw 2 ⇒ w 1 vw 2 for the morphism f "extended by context". This enables us to equip the category Σ * 2 with a structure of monoidal category: given two morphisms

f ∶ u ⇒ v and f ′ ∶ u ′ ⇒ v ′ , we can define a morphism f ⊗ f ′ ∶ (u ⊗ u ′ ) ⇒ (v ⊗ v ′
) which corresponds to performing the two rewriting paths f and f ′ in parallel. Formally, the tensor product is defined on objects by concatenation (u

⊗ v = uv) and on morphisms f ∶ u ⇒ v and f ′ ∶ u ′ ⇒ v ′ by f ⊗ f ′ = (f u ′ ) ○ (vf ′
). This monoidal structure on the category Σ * 2 induces a shift in the dimension of objects. However, this category is a monoidal category, which equivalently amounts to say that it is a 2-category with only one 0-cell, the objects of Σ * In the following, we adopt this convention for the dimension of cells, but we keep drawing diagrams as the one on the left, since those are closer to diagrams traditionally used in rewriting theory. This also applies to Σ ⊺ 2 , which is also be considered as a 2-category (with invertible 2-cells) in the following.

We can now introduce the notion of coherent presentation, by enriching presentations with a suitable specified set of confluence 3-cells. Below, two 2-cells are said to be parallel when they have the same source and the same target 1-cells. ▸ Definition 4. A (finite) extended presentation (Σ, s 2 , t 2 , Σ 3 ) consists of a (finite) presentation Σ, together with a (finite) set Σ 3 of 3-cells (or homotopy generators) and two maps s 2 , t 2 ∶ Σ 3 → Σ ⊺ 2 associating, to each 3-cell A, parallel 2-cells of Σ ⊺ 2 which are respectively its source s 2 (A) ∶ u ⇒ v and its target t 2 (A) ∶ u ⇒ v (cf. the diagram on the right).

A Õ u s 2 (A) $ , t 2 (A) P F v A homotopy relation on Σ ⊺
2 is an equivalence relation ≡ on parallel 2-cells which is stable under context and composition: -for any f and g in Σ ⊺

2 and any u and

v in Σ * 1 , f ≡ g implies uf v ≡ ugv, -for any h ∶ u ′ ⇒ u, f, g ∶ u ⇒ v and k ∶ v ⇒ v ′ in Σ ⊺ 2 , f ≡ g implies h ○ f ○ k ≡ h ○ g ○ k.
In particular, given an extended presentation Σ, we write ≡ Σ3 for the smallest homotopy relation containing Σ 3 .

▸ Definition 5. A (finite) coherent presentation is a (finite) extended presentation Σ such that the homotopy relation generated by Σ 3 is the homotopy relation on Σ ⊺

2 containing every pair of parallel 2-cells.

▸ Example 6. The presentation Σ of Example 3 can be extended into a coherent presentation with the three diagrams A, B and C of (3) as set of 3-cells. For instance, we have s 2 (A) = βa and t 2 (A) = sα ○ γ. Notice that, since the 2-cells of Σ ⊺ 2 are invertible, different choices for the source and target of 3-cells could still give a coherent presentation, such as

s 1 (A) = (βa) -1 ○ (sα) and t 1 (A) = γ -1 .
In the same way that rewriting systems present monoids, a coherent presentation presents a 2-category. Namely, given a coherent presentation Σ, one can define a 2-category, denoted by Σ ⊺ 2 Σ 3 , as the 2-category Σ ⊺ 2 whose 2-cells have been quotiented by the homotopy relation ≡ Σ3 . Notice that this 2-category always has its 2-cells invertible.

R TA

Transformations of coherent presentations

Starting from a non-convergent presentation of a monoid, the Knuth-Bendix procedure provides a (convergent) presentation on the same set of generators, but a monoid can also admit other presentations with different sets of generators. The notion of Tietze transformation [START_REF] Tietze | Über die topologischen Invarianten mehrdimensionaler Mannigfaltigkeiten[END_REF] describes elementary transformations (adding and removing definable generators or derivable rules) on presentations, leaving unchanged the presented monoid. Moreover, they are complete in the sense that two presentations of the same monoid are related by Tietze transformations. In [START_REF] Gaussent | Coherent presentations of Artin groups[END_REF], a corresponding notion has been introduced for extended presentations, defined as the composites of the following elementary transformations:

1. add a generator T + u : for u in Σ * 1 , add x u to Σ 1 and δ u ∶ u ⇒ x u to Σ 2 , 2. add a relation T + f : for f ∶ u ⇒ v in Σ ⊺ 2 , add χ f ∶ u ⇒ v to Σ 2 and A f ∶ f ⇛ χ f to Σ 3 , 3. add a 3-cell T + (f,g) : for f ≡ Σ3 g in Σ ⊺ 2 , add Ψ ∶ f ⇛ g to Σ 3 ,

remove a generator T -

x : for α ∶ u ⇒ x in Σ 2 , with x ∈ Σ 1 and u ∈ (Σ 1 ∖{x}) * , remove x and α and replace x by u in the relations and 3-cells and α by 1 u in the 3-cells,

remove a relation T -

α : for A ∶ f ⇛ α in Σ 3 , with α ∈ Σ 2 and f ∈ (Σ 2 ∖ {α}) * , remove α and A and replace α by f in the 3-cells, 6. remove a 3-cell T - A : for A ∶ f ⇛ g in Σ 3 with f ≡ Σ3∖{A} g, remove A. 1. u δ u 7 9 x u 2. A f Õ u f # χ f Y O v 3. Ψ Õ u f # g Y O v 4. u α 7 9 x 5. A Õ u f # α Y O v 6. B Õ A Õ u f # g Y O v
A (finite) Tietze transformation is a (finite) composite of elementary Tietze transformations. The notion of Tietze-equivalence on presentations can be generalized to extended presentations: Σ and Υ are Tietze-equivalent extended presentations if they are Tietzeequivalent as presentations and when there is an equivalence of categories (Σ ⊺ 2 Σ 3 ) ≅ (Υ ⊺ 2 Υ 3 ), see [START_REF] Gaussent | Coherent presentations of Artin groups[END_REF]. In particular, coherent presentations of a same monoid are Tietze-equivalent. As in the case of presentations, we have for extended presentations: ▸ Theorem 7 ([9]). Two (finite) extended presentations are Tietze-equivalent if, and only if, there exists a (finite) Tietze transformation between them.

Computing coherent presentations

We investigate a method to construct of coherent presentations from convergent ones, based on Squier's theory. We suppose fixed a presentation Σ. A branching of Σ is a pair

(f ∶ u ⇒ v, g ∶ u ⇒ w) of 2-cells of Σ *
2 with a common source. Such a branching is local when f and g are both rewriting steps, Peiffer when it is of the form

(f ′ v, ug ′ ) or (vf ′ , g ′ u) for some rewriting steps f ′ ∶ u ⇒ u ′ , g ′ ∶ v ⇒ v ′ ,
and overlapping when it is not Peiffer and f and g are distinct. A branching is critical when it is overlapping and minimal for the order generated on branchings by (f, g) ≼ (uf v, ugv), for any words u and v. A branching

(f, g) ∶ u ⇒ (v, w) is confluent when there exist a pair of 2-cells f ′ ∶ v ⇒ u ′ and g ′ ∶ w ⇒ u ′ in Σ * 2 .
We say that Σ is (locally) confluent when all of its (local) branchings are confluent. We say that Σ is convergent when it terminates and it is confluent. By Newman's lemma, local confluence is equivalent to confluence of critical branchings for terminating rewriting systems. This result can be reformulated in the setting of coherent presentations as follows.

A family of generating confluences of Σ is a set of 3-cells over Σ ⊺ 2 that contains, for every critical branching (f, g) of Σ, one 3-cell whose shape is as in the diagram on the right.

v f ′ " * σ f,g Õ u f 9 ; g 5 7 u ′ w g ′ S I
If Σ is confluent, it always admits at least one family of generating confluences. Given a convergent presentation Σ, we denote by S(Σ) the extended presentation obtained from Σ by adjunction of a chosen family of generating confluences of Σ. The presentation S(Σ) is only defined up to that choice, but two families of generating confluences give Tietze-equivalent extended presentations [START_REF] Guiraud | Higher-dimensional normalisation strategies for acyclicity[END_REF]. Squier proved in [START_REF] Squier | A finiteness condition for rewriting systems[END_REF] the following result.

▸ Theorem 8 (Squier's theorem). Let Σ be a (finite) convergent presentation of a monoid M.

The extended presentation S(Σ) is a (finite) coherent and convergent presentation of M.

Several examples of this construction are given in [START_REF] Lafont | A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)[END_REF]. Squier proved that the property, for a finite presentation of a monoid M, to be extendable into a finite coherent presentation is an invariant of M, that is, one given finite presentation of M is extendable into a finite coherent presentation if, and only if, all of them are [START_REF] Squier | A finiteness condition for rewriting systems[END_REF]. However, there are finitely presented decidable monoids with no finite coherent presentation (such an example was exhibited by Squier). For such a monoid, starting with a finite presentation, there is no hope to obtain a finite convergent presentation, by using the Knuth-Bendix procedure or other methods, with the same set of generators or another one. Conversely, if the Knuth-Bendix procedure terminates on a finite presentation, then it can be extended into a finite coherent presentation.

Homotopical completion and reduction procedures

As seen in Section 1.3, Squier's theorem extends a convergent presentation into a coherent one. With the Knuth-Bendix completion procedure, those are the two basic ingredients of the homotopical completion procedure we present, extended by a homotopical reduction procedure whose goal is to eliminate superfluous cells.

The homotopical completion procedure

This procedure, denoted by HC, interleaves the Knuth-Bendix completion and Squier's theorem to produce a coherent and convergent presentation from a terminating presentation: it examines the critical branchings one by one, potentially adding 2-cells to reach a convergent presentation, but also 3-cells that tend towards forming a coherent presentation.

Let Σ be a terminating presentation, seen as an extended presentation with no 3-cell. Thereafter, we always assume that termination is due to a fixed total termination order. For every critical branching (f, g) ∶ u ⇒ (v, w) of Σ, the procedure HC computes 2-cells

f ′ ∶ v ⇒ v and g ′ ∶ w ⇒ ŵ in Σ * 2 ,
where v and ŵ are some normal forms for v and w, respectively. There are two possibilities: -if v = ŵ, the dotted 3-cell A is added, as in situation (a), -otherwise, for example if v < ŵ, the Tietze transformation T + g ′-1 ○g -1 ○f ○f ′ is applied to add the dotted 2-cell χ and 3-cell A, as in (b).

(a) v f ′ # + A Õ u f 8 : g 6 8 v = ŵ w g ′ R H (b) v f ′ 7 9 A Õ v u f 8 : g 6 8 w g ′ 7 9 ŵχ i Y

R TA

The adjunction of new 2-cells can create new critical branchings: the HC procedure iterates this operation until it reaches, potentially after an infinite time, a stable extended presentation HC(Σ). From a computational point of view, an application of Squier's theorem to the result of the Knuth-Bendix completion on Σ would require to compute again all the critical branchings explored during completion, when the HC procedure computes 3-cells during completion. The properties of the Knuth-Bendix procedure and Squier's theorem induce the following result.

An optimized homotopical completion procedure

The HC procedure computes a coherent and convergent presentation that contains, in general, superfluous 3-cells, in the sense that they are not necessary to relate all the parallel 2-cells. To eliminate them, we apply a homotopical reduction mechanism in dimension 3: it computes the critical triple branchings to produce relations between 3-cells and to eliminate some of them by Tietze transformations. A critical triple branching (f, g, h) is a triple of distinct rewriting steps with common source, such that each one overlaps with at least one of the other two, and that is minimal for the order ≼ generated by relations (f, g, h) ≼ (uf v, ugv, uhv) for every such triples (f, g, h) and words u, v.

Let Σ be a convergent and coherent presentation. The homotopical reduction in dimension 3 builds, for each critical triple branching (f, g, h) of Σ, a 4-cell Ω with shape

v f ′ 1 3 5 A Õ x ′ h ′′ ! v f ′ 1 3 5 f ′ 2 " * x ′ h ′′ ! B ′ Õ u f D @ g 7 9 h 0 2 w g ′ 1 R H g ′ 2 " * û Ω 1 ? u f D @ h 0 2 w ′ g ′′ 7 9 û x h ′ 2 B > B Õ v ′ f ′′ a Q C ′ Õ x h ′ 1 R H h ′ 2 A = C Õ v ′ f ′′ a Q A ′ Õ
as follows. We consider the branching (f, g) and use confluence to get f ′ 1 and g ′ 1 and, then, coherence to build the 3-cell A. We proceed similarly with the branchings (g, h) and (f, h). Then, for the branching (f ′ 1 , f ′ 2 ), we use convergence to get g ′′ and h ′′ with û as common target, and the 3-cell B ′ by coherence. We do the same operation with (h ′ 1 , h ′ 2 ) to get A ′ . Finally, we get the 3-cell C ′ by coherence. The source and the target of Ω are made of generating 3-cells of Σ in context: they have shape uXv where X is a generating 3-cell and u and v are words. If one of those generating 3-cell appears only once and in an empty context (u = v = 1), then Ω is used as a definition of X in terms of the other 3-cells: X is removed by a Tietze transformation.

A coherent and convergent presentation on which no 3-cell can be removed by homotopical reduction in dimension 3 is called reduced. The optimized homotopical completion procedure HC applies homotopical reduction in dimension 3 after HC. Since the procedure acts by Tietze transformations only, we get: ▸ Theorem 11. Let Σ be a terminating presentation of a monoid M. The extended presentation HC(Σ) is a reduced coherent and convergent presentation of M, that is finite if, and only if, the presentation Σ is finite and the homotopical completion procedure HC terminates.

▸ Example 12. After the HC procedure is applied to the Kapur-Narendran presentation of the monoid B + 3 , we have four critical triple branchings, overlapping on the words sasta, sasast, sasasas and sasasaa. On sasta, we get the 4-cell For the same reasons, the 4 cell Ω 2 removes D, leaving only the 3-cells A and B to form a reduced coherent and convergent presentation of the monoid B + 3 . The other two critical triple branchings on words sasasas and sasasaa do not generate any other relation. Indeed, since the relations are weight-homogeneous (they relate words with the same weight, where s and t have weight 1 and a has weight 2), all the words that occur in the 4-cells corresponding to sasasas and sasasaa have weight 10 and 11, respectively. Since A and B have respective weights 4 and 5, their potential occurrences in those 4-cells must be in non-empty contexts.

The homotopical completion-reduction procedure

After the HC procedure, we get a reduced coherent and convergent presentation of the considered monoid. Its underlying presentation is, in general, not minimal since homotopical completion has potentially adjoined superfluous 2-cells to get confluence. However, for each of those extra 2-cells, a 3-cell has also been added to fill the corresponding confluence diagram: a Tietze transformation can be used to remove both of them.

R TA

Given a coherent presentation Σ, we call homotopical reduction in dimension 2 the following process. For each 3-cell A of Σ 3 , its source and target are made of reduction steps uαv, where α is a generating 2-cell and u and v are words. If one such α appears only once and in an empty context (u = v = 1), both α and A are removed by a Tietze transformation. On the special case of HC(Σ), every superfluous 2-cell appears once and in an empty context in the boundary of its associated 3-cell. The homotopical completion-reduction procedure HCR applies homotopical reduction in dimension 2 after HC. Since the procedure acts by Tietze transformations only, we get: ▸ Theorem 13. Let Σ be a terminating presentation of a monoid M. The extended presentation HCR(Σ) is a coherent presentation of M, whose underlying presentation is contained in Σ, and it is finite if, and only if, the homotopical completion procedure terminates.

▸ Example 14. After the HC procedure is applied to the Kapur-Narendran presentation of the monoid B + 3 , we have a coherent presentation with three generators s, t and a, four 2-cells α, β, γ and δ and two 3-cells A and B, corresponding to the adjunction of γ and δ respectively. They are removed by the HCR procedure, yielding a coherent presentation of B + 3 with the 2-cells α and β only, and no 3-cell. Informally, for two words on {s, t, a} that represent the same element in the monoid B + 3 , there is only one proof of their equality modulo α and β.

Completion and reduction on generators

As proved by Kapur and Narendran [START_REF] Kapur | A finite Thue system with decidable word problem and without equivalent finite canonical system[END_REF], the introduction of superfluous generators can be necessary for completion to terminate. These generators can of course be added by hand before the completion, but we briefly indicate here a possible heuristic, based on algebraic properties observed on the examples in Section 3. Indeed, in those cases, it always helps completion to add generators of the quasicenter of each submonoid. More precisely, for a given presentation Σ of a monoid M, we seek minimal elements u of Σ * 1 such that uX = Xu holds in M for a maximal subset X of Σ 1 . Such a property is possible to observe during completion: one computes the products ux and xu for u a word of bounded length and x a generator. If uX = Xu for a set X of generators, one adds a new generator (u) and a relation u ⇒ (u). Moreover, the cardinal of X seems to determine a way to extend to (u) the termination order used for completion (see 3.3).

Whether the generators have been added before or during homotopical completion, one can remove them at the end. Indeed, each superfluous generator (u) comes with a defining relation α ∶ u ⇒ (u), so that a Tietze transformation removes both of them (and replaces (u) by u and α by the identity in the boundary of the other 2-cells and 3-cells). Applied to the result of the HCR completion on the Kapur-Narendran presentation of the monoid B + 3 , this contracts the obtained coherent presentation (with no 3-cell) to Artin presentation of the monoid B + 3 , proving that this is also a coherent presentation with no 3-cell.

Applications

The results mentioned in this section were obtained with the help of a prototype implementation; an online version (unfortunately much slower than the offline one) is available1 .

The braid monoid

The Artin presentation. The monoid B + n of positive braids on n strands is defined by

B + n = ⟨s 1 , . . . , s n-1 s i s i+1 s i = s i+1 s i s i+1 for 1 ≤ i < n -1 and s i s j = s j s i for i -j ≥ 2⟩ (4)
This presentation, called Artin presentation, is known to be minimal, so that one wants to compute a minimal coherent presentation of the monoid B + n by extending it. In [START_REF] Tits | A local approach to buildings[END_REF], Tits proved a result that implies that a coherent presentation is given by 3-cells whose boundaries are in one of the Artin submonoid of rank 3 of B + n , i.e. the boundary of each 3-cell is made of copies of the three relations involving only three given distinct generators. As a direct consequence, Artin presentation with no 3-cell is a coherent presentation of the monoid B + 3 , but this result fails to say anything about B + 4 and does not give an explicit description of the coherence cells of B + n for n ≥ 5. Unfortunately, homotopical completion cannot be used either in practice because it does not terminate on Artin presentation: indeed, as proved by Kapur and Narendran, any orientation of a relation sts = tst generates a relation stsst k = ts k+1 ts for every k ≥ 1 that must be contained in every convergent presentation [START_REF] Kapur | A finite Thue system with decidable word problem and without equivalent finite canonical system[END_REF].

The Kapur-Narendran presentation. As far as we know, the adjunction of the superfluous generator for B + 3 , as seen in the introduction, has not been studied for B + n with n > 3. There are several possible generalizations, but we define the Kapur-Narendran presentation of B + n as the one obtained from Artin presentation by adjunction of superfluous generators corresponding to a Coxeter element for each Artin submonoid of B + n , namely all the products s i1 ⋯s i k for every 1 ≤ i 1 < ⋯ < i k < n. Our experiments lead to positive results for the cases n = 4 and n = 5, see Table 1. We have also tested the Kapur-Narendran presentation on well-known generalizations of the braids monoids known as Artin monoids and got a finite coherent and convergent presentation for the Artin monoids of types B 2 , B 3 , B 4 and F 4 (the braid monoid B + n is the Artin monoid of type A n-1

). An open question is to determine if the Kapur-Narendran presentation yields a finite coherent and convergent presentation for any braid monoid and, more generally, for other types of Artin monoids.

The Garside presentation. The Kapur-Narendran presentation is contained in a bigger presentation called the Garside presentation [START_REF] Garside | The braid group and other groups[END_REF]. For B + 3 , the Garside presentation is obtained from Artin one by adjunction of superfluous generators (st), (ts) and (sts) corresponding to products st, ts and sts respectively: the element sts is the generator of the quasicenter of B + 3 and the elements s, t, st and ts are all its divisors. On the Garside presentation, the homotopical completion procedure produces a finite coherent and convergent presentation with five generators, twelve relations and 24 3-cells; the corresponding normal forms are known as Deligne's normal forms [START_REF] Deligne | Les immeubles des groupes de tresses généralisés[END_REF]. Deligne has proved in [START_REF] Deligne | Action du groupe des tresses sur une catégorie[END_REF] that this coherent presentation of B + 3 can be reduced to one with six relations st ⇒ (st) ts ⇒ (ts) s(ts) ⇒ (sts) t(st) ⇒ (sts) (st)s ⇒ (sts) (ts)t ⇒ (sts)

and two 3-cells:

(st)s $ , Õ sts @ < 4 6 (sts) s(ts) P F (ts)t $ , Õ tst @ < 4 6 (sts) t(st) P F
The homotopical completion-reduction, applied to the Garside presentation, gives a new, constructive proof of this result [START_REF] Gaussent | Coherent presentations of Artin groups[END_REF]. In fact, it goes even further: the 3-cells are used to R TA remove the relations (st)s ⇒ (sts) and (ts)t ⇒ (sts) and, then, the relations st ⇒ (st), ts ⇒ (ts) and s(ts) ⇒ (sts) remove the generators (st), (ts) and (sts). This leaves the generators s and t, the relation t(st) ⇒ (sts), projected onto tst ⇒ sts, and no coherence cell, yielding another proof that Artin presentation with no 3-cell is a coherent presentation of B + 3 . The Garside presentation exists for every monoid B + n and, more generally, for every Artin monoid: in the spherical case (such as B + n ), its generators are made of the generator of the quasicenter of every Artin submonoid, plus all of its divisors. On this presentation, the homotopical completion-reduction procedure also applies, extending Deligne's result to non-spherical Artin monoids. Moreover, in [START_REF] Gaussent | Coherent presentations of Artin groups[END_REF], Gaussent and the first two authors apply homotopical reduction further to get an explicit coherent presentation of every Artin monoid, thus, in particular, giving a constructive proof of Tits's result. For the particular case of B + 4 , the homotopical completion-reduction procedure gives a (minimal) coherent presentation made of Artin presentation with exactly one coherence cell, known as the Zamolodchikov relation: The Brieskorn-Saito presentation. For the monoid B + 3 , it is defined by the adjunction to Artin presentation of a generator (sts) for sts [START_REF] Brieskorn | Artin-Gruppen und Coxeter-Gruppen[END_REF]. This presentation is known in general for Artin monoids and obtained by adjunction of the generator (when it exists) of the quasicenter of each Artin submonoid. Those generators produce special normal forms that, up to our knowledge, are not yet linked to a convergent presentation. Contrarily to Garside's generators, Brieskorn-Saito's generators come in a finite number for every Artin monoid, motivating the research for a finite convergent presentation on those generators to give a solution to the still-open word problem for general Artin groups. Our experiments show that, on the Brieskorn-Saito presentation, the homotopical completion procedure gives a finite coherent and convergent presentation for the monoids B + 3 , B + 4 and B + 5 , but also for other Artin monoid such as the ones of type B 3 and, interestingly, of type Ã2 : this last example is an Artin monoid of affine type, for which the Garside presentation is infinite.

The plactic monoid

The Knuth presentation. The plactic monoid P n of rank n is given by the Knuth presentation:

P n = ⟨x 1 , . . . , x n x j x i x k = x j x k x i for i < j ≤ k and x i x k x j = x k x i x j for i ≤ j < k⟩.
This monoid originates in the work of Schensted [START_REF] Schensted | Longest increasing and decreasing subsequences[END_REF], Knuth [START_REF] Knuth | Permutations, matrices, and generalized young tableaux[END_REF] and Lascoux and Schützenberger [START_REF] Lascoux | ), volume 109 of Quad[END_REF]. It has found several applications, such as in representation theory [START_REF] Littelmann | A plactic algebra for semisimple Lie algebras[END_REF] because of its strong connection to Young tableaux: semistandard Young tableaux correspond to elements of the plactic monoid and Schensted's insertion algorithm gives a way to compute normal forms for the Knuth presentation of the plactic monoid. This terminating presentation (for the deglex order generated by a < b for example) is already convergent: the homotopical completion procedure yields a homotopy basis with exactly one coherence cell depicted on the right. Moreover, the convergent presentation has no critical triple branching: hence the computed coherent presentation of the monoid P 2 is minimal.

In the case n = 3, with generators a, b and c, the Knuth presentation has eight relations, three pairs corresponding to the three plactic submonoids over two of the three generators, plus two relations involving all three generators: γ ∶ cab ⇒ acb and δ ∶ bca ⇒ bac. For the monoid P 3 , the Knuth presentation is not confluent anymore (on words cbba, ccbaa, ccbab) and homotopical completion adds three more relations: ε ∶ cbab ⇒ bcba, ϕ ∶ cbaba ⇒ cacba and ψ ∶ cbcba ⇒ cbacb. At the end, we get a finite coherent and convergent presentation with 27 3-cells, corresponding to all the critical branchings. The presentation also has 29 triple critical branchings, and homotopical reduction uses four of them to eliminate of four 3-cells. Then, the removal of the three extra relations and their corresponding coherence cells, added by completion, yields a homotopy basis with 20 coherence cells for the Knuth presentation of the monoid P 3 .

For higher values of n, the homotopical completion procedure cannot succeed on the Knuth presentation. Indeed, as in the case of braid monoids, a proof similar to the one of Kapur and Narendran for the monoid B + 3 shows that the infinite family of relations cbc k dca = cbac k dc, for every natural number k, must be part of any convergent presentation of the monoid P n .

The column presentation. The analogy with Young tableaux leads to introduce a finite number of superfluous generators to the Knuth presentation of P n , representing all the possible columns in semistandard Young tableaux: one generator (x i k ⋯x i1 ) for every possible 1 < k ≤ n and 1 ≤ i 1 < ⋯ < i k ≤ n, together with the corresponding defining relation x i k ⋯x i1 ⇒ (x i k ⋯x i1 ). The column generators have an important property in plactic monoids: indeed, the center (and the quasicenter) of the plactic monoid P n is generated by exactly one element: x n ⋯x 1 . Thus the column generators for P n are exactly the generators of the quasicenters of all the plactic submonoids of P n .

From the column presentation, homotopical completion yields a finite coherent and convergent presentation of P n (as in [START_REF] Cain | Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids[END_REF]). In particular, for the monoid P 4 , we get the following construction. Starting with the Knuth presentation with four generators and 20 relations, we add the eleven column generators (ba, ca, cb, da, db, dc, cba, dba, dca, dcb, dcba) and the corresponding relations to get 15 generators and 31 relations. Homotopical completion results in a finite coherent and convergent presentation with 115 relations and 621 3-cells. Then, homotopical reduction in dimension 3 uses the triple critical branchings to reduce the number of 3-cells to 212. The removal of the 84 relations and 3-cells added during homotopical completion, then of the eleven superfluous generators and their defining relations, finally produces a coherent presentation made of the Knuth presentation of the monoid P 4 and 128 3-cells.

The Chinese monoid

The standard presentation. The Chinese monoid Ch n of rank n is defined by

Ch n = ⟨x 1 , . . . , x n x j x k x i = x k x i x j = x k x j x i for i ≤ j ≤ k⟩.

R TA

It is a variant of the plactic monoid discovered in [START_REF] Duchamp | Plactic-growth-like monoids[END_REF]. For n = 2, the Chinese monoid coincides with the plactic monoid P 2 : its standard presentation (with the orientation baa ⇒ aba and bba ⇒ bab) is convergent and, with the same 3-cell as P 2 , forms a coherent presentation of Ch 2 . For higher values of n, the presentation of Ch n (with the orientation x k x i x j ⇒ x j x k x i and x k x j x i ⇒ x j x k x i ) is not convergent anymore, but it can be finitely completed (without change of generators) by adjunction of the relations

x k x j x k x i ⇒ x k x i x k x j for 1 ≤ i < j < k ≤ n.
The homotopical completion-reduction yields a coherent presentation made of the standard presentation extended with 12 3-cells for Ch 3 , 56 for Ch 4 and 176 for Ch 5 .

The quasicentral presentation. The (quasi)center of the monoid Ch n is generated by the element x n x 1 [START_REF] Cassaigne | The Chinese monoid[END_REF]. Thus, the generators of the quasicenters of all the Chinese submonoids of Ch n are exactly the elements x j x i for 1 ≤ i < j ≤ n. Our experiments, conducted up to n = 5, show that the adjunction of those elements as superfluous generators still allow completion to reach a finite convergent presentation. Moreover, the obtained finite convergent presentation gives a rewriting-based procedure to compute the column normal form [START_REF] Cassaigne | The Chinese monoid[END_REF]. For the completion, a special order has to be chosen (corresponding to the column normal form), such as a weight lexicographic order, where each x i has weight 1 and (x j x i ) has weight 2, and with an order on generators that satisfies (x l x i ) > (x k x j ) if i ≤ j ≤ k ≤ l with i ≠ j or k ≠ l. This last inequality can be determined automatically from the fact that (x k x i ) commutes with l -i elements and (x k x j ) with k -j and, by assumption, we have l -i > k -j. 1 Results of experiments indicating, for various sets of generators, the number of generators, relations (before and after completion), and homotopy generators (before and after homotopy reduction by 4-cells) of the completed rewriting system. Values marked " † " arise from theoretical computations, and "?" indicate computations too big to be performed in reasonable time with our prototype implementation.

Conclusion

We have generalized the Knuth-Bendix completion procedure to coherent presentations, which has enabled us to formulate a reduction procedure. Some practical outcomes have been investigated, providing constructive results about presentations of braid, plactic and Chinese monoids. These procedures have been implemented in a proof-of-concept software, and much work remain to be done in order to better understand the structures put to use and how to efficiently manipulate them. The idea of adding superfluous generators seems very promising, but we have only been able to provide heuristics to do so which have to be refined and supported by more experiments. Finally, the approach developed here handles generators, relations and homotopy generators uniformly; its likely extension to higher dimensions will be investigated in future works, in relation with methods for constructing minimal presentations of algebraic structures. The reduced set of homotopy generators is cba --Da--> (cb)a --K--> (cba) cba --cF--> c(ba) --V--> (cba) R TA

2 being the 1 -

 1 cells and the morphisms of Σ * 2 being the 2-cells. From a diagrammatic point of view, this means that

▸ Theorem 9 .

 9 Let Σ be a terminating presentation of a monoid M. The extended presentation HC(Σ) is a coherent and convergent presentation of M and it is finite if, and only if, the presentation Σ is finite and the homotopical completion procedure terminates. ▸ Example 10. The Kapur-Narendran presentation B + 3 = ⟨s, t, a α ∶ ta ⇒ as, β ∶ st ⇒ a⟩ has two non-confluent critical branchings, resulting in the adjunction of the 2-cells γ and δ as in (2) and the 3-cells A and B as in (3). The 2-cells γ and δ generate two new critical branchings that are confluent: the HC procedure adds two extra 3-cells C and D and terminates with this finite coherent and convergent presentation of the monoid B + 3 .

This 4 -

 4 cell proves that C is superfluous in the coherent presentation: it appears only once in the boundary of Ω 1 , in an empty context (unlike A and B). Then, we consider the critical triple branching with source sasast:

  In the case n = 2, the Knuth presentation has two generators x 1 = a and x 2 = b and two relations α ∶ baa ⇒ aba and β ∶ bba ⇒ bab.

of the monoid B + 3 3 .

 33 We give below an example of usage of our prototype tool 2 to compute a reduced coherent presentation of the braid monoid B + Generate the Artin monoid B + 3 (which is of Artin type A 2 ).# artin a2 a,b | A : bab -> abaWe have 1 generator and 1 rule.Perform a Knuth-Bendix completion.# kbc Timeout!Add the Kapur-Narendran generator. # rgen ba a,b,ba | A : bab -> aba, B : ba -> (ba) We have 3 generators and 2 rules. Perform a Knuth-Bendix completion. # kbc a,b,ba | B : ba -> (ba), D : (ba)b -> a(ba), E : a(ba)a -> (ba)(ba), G : (ba)(ba)a -> b(ba)(ba) We have 3 generators and 4 rules. Compute homotopy generators. # hbasis ba(ba)a --B(ba)a--> (ba)(ba)a --G--> b(ba)(ba) ba(ba)a --bE--> b(ba)(ba) (ba)ba --Da--> a(ba)a --E--> (ba)(ba) (ba)ba --(ba)B--> (ba)(ba) a(ba)a(ba)a --E(ba)a--> (ba)(ba)(ba)a --(ba)G--> (ba)b(ba)(ba) --D(ba)(ba)--> a(ba)(ba)(ba) a(ba)a(ba)a --a(ba)E--> a(ba)(ba)(ba) (ba)(ba)a(ba)a --G(ba)a--> b(ba)(ba)(ba)a --b(ba)G--> b(ba)b(ba)(ba) --bD(ba)(ba)--> ba(ba)(ba)(ba) --B(ba)(ba)(ba)--> (ba)(ba)(ba)(ba) (ba)(ba)a(ba)a --(ba)(ba)E--> (ba)(ba)(ba)(ba) We have 4 homotopy generators.Compute a reduced set of homotopy generators.

A. 2 4

 24 )a(ba)a --E(ba)a--> (ba)(ba)(ba)a --(ba)G--> (ba)b(ba)(ba) --D(ba)(ba)--> a(ba)(ba)(ba) a(ba)a(ba)a --a(ba)E--> a(ba)(ba)(ba) with --Da(ba)a--> --(ba)B(ba)a--> --(ba)bE--> We remove (ba)(ba)a(ba)a --G(ba)a--> b(ba)(ba)(ba)a --b(ba)G--> b(ba)b(ba)(ba) --bD(ba)(ba)--> ba(ba)(ba)(ba) --B(ba)(ba)(ba)--> (ba)(ba)(ba)(ba) (ba)(ba)a(ba)a --(ba)(ba)E--> (ba)(ba)(ba)(ba) with --B(ba)a(ba)a--> --bE(ba)a--> --ba(ba)E--> The reduced set of homotopy generators is ba(ba)a --B(ba)a--> (ba)(ba)a --G--> b(ba)(ba) ba(ba)a --bE--> b(ba)(ba) (ba)ba --Da--> a(ba)a --E--> (ba)(ba) (ba)ba --(ba)B--> (ba)(ba) We have 2 homotopy generators. Completion of the monoid B + Generate the Artin monoid B + 4 (which is of Artin type A 3 ). # artin a3 a,b,c | A : bab -> aba, B : cbc -> bcb, C : ca -> ac We have 3 generators and 3 rules. Add the Kapur-Narendran generators. # rgensw cba a,b,c,cb,ca,ba,cba | A : bab -> aba, B : cbc -> bcb, C : ca -> ac, D : cb -> (cb), E : ca -> (ca), F : ba -> (ba), G : cba -> (cba) We have 7 generators and 7 rules. Perform a Knuth-Bendix completion. # kbc a,b,c,cb,ca,ba,cba | D : cb -> (cb), E : ca -> (ca), F : ba -> (ba), J : ac -> (ca), K : (cb)a -> (cba), L : (ba)b -> a(ba), M : (cb)c -> b(cb), N : (cb)(ca) -> b(cba), O : b(cb)b -> (cb)(cb), P : a(ba)a -> (ba)(ba), ... We have 7 generators and 47 rules.

  Compute homotopy generators.# hbasis cba --Da--> (cb)a --K--> (cba) cba --cF--> c(ba) --V--> (cba) cb(cb)b --D(cb)b--> (cb)(cb)b --M1--> c(cb)(cb) cb(cb)b --cO--> c(cb)(cb) cb(cba)(ba) --D(cba)(ba)--> (cb)(cba)(ba) --S2--> c(cba)(cba) cb(cba)(ba) --cC1--> c(cba)(cba) [...]We have 356 homotopy generators.Compute a reduced set of homotopy generators.

  (ba)(cb)(ba)(ba)(cba)(ba) --J3(ba)(cba)(ba)--> (cb)(ba)(cb)(cba)(ba)(cba)(ba) --(cb)(ba)S2(cba)(ba)--> (cb)(ba)c(cba)(cba)(cba)(ba) --(cb)T(cba)(cba)(cba)(ba)--> (cb)b(ca)(cba)(cba)(cba)(ba) --(cb)b(ca)A3--> (cb)b(ca)(cb)(cba)(cba)(cba) (cba)(ba)(cb)(ba)(ba)(cba)(ba) --(cba)(ba)(cb)V2--> (cba)(ba)(cb)b(ba)(cba)(cba) --O2(ba)(cba)(cba)--> (cb)(ba)(cb)(cb)(ba)(cba)(cba) --(cb)(ba)U1(cba)(cba)--> (cb)(ba)c(cb)(cba)(cba)(cba) --(cb)T(cb)(cba)(cba)(cba)--> (cb)b(ca)(cb)(cba)(cba)(cba) with --J3(ba)(cb)(ba)b--> --(cba)(ba)(cb)I3b--> --(cba)(ba)(cb)(ba)(ba)(cb)L--> We remove (cba)(ba)(cb)(ba)(cba)(cba)(ba) --J3(cba)(cba)(ba)--> (cb)(ba)(cb)(cba)(cba)(cba)(ba) --(cb)(ba)(cb)A3--> (cb)(ba)(cb)(cb)(cba)(cba)(cba) (cba)(ba)(cb)(ba)(cba)(cba)(ba) --(cba)(ba)(cb)E3--> (cba)(ba)(cb)b(cba)(cba)(cba) --O2(cba)(cba)(cba)--> (cb)(ba)(cb)(cb)(cba)(cba)(cba) with --J3(ba)(cba)(ba)b--> --(cba)(ba)(cb)V2b--> --(cba)(ba)(cb)(ba)(ba)(cba)L--> We remove (cba)(ba)(cb)(ba)(ba)(cb)(ba) --J3(ba)(cb)(ba)--> (cb)(ba)(cb)(cba)(ba)(cb)(ba) --(cb)(ba)S2(cb)(ba)--> (cb)(ba)c(cba)(cba)(cb)(ba) --(cb)T(cba)(cba)(cb)(ba)--> (cb)b(ca)(cba)(cba)(cb)(ba) --(cb)b(ca)(cba)E1(ba)--> (cb)b(ca)(cba)(ba)(cba)(ba) --(cb)b(ca)W2--> (cb)b(ca)(cb)(ba)(cba)(cba) (cba)(ba)(cb)(ba)(ba)(cb)(ba) --(cba)(ba)(cb)I3--> (cba)(ba)(cb)b(ba)(cb)(cba) --O2(ba)(cb)(cba)--> (cb)(ba)(cb)(cb)(ba)(cb)(cba) --(cb)(ba)U1(cb)(cba)--> (cb)(ba)c(cb)(cba)(cb)(cba) --(cb)T(cb)(cba)(cb)(cba)--> (cb)b(ca)(cb)(cba)(cb)(cba) --(cb)b(ca)(cb)E1(cba)--> (cb)b(ca)(cb)(ba)(cba)(cba) with --J3(ba)(cb)ba--> --(cba)(ba)(cb)P2a--> --(cba)(ba)(cb)(ba)(ba)(cb)F--> [...]

http://www.pps.univ-paris-diderot.fr/~smimram/rewr/

http://www.pps.univ-paris-diderot.fr/~smimram/rewr/ R TA

A.3 Other examples

Other examples mentioned in this article can be tested similarly as follows.

The plactic monoid (e.g. P 4 ).