Correspondence between factorability and normalisation in monoids

Abstract: The purpose of this note is to investigate the relation between two notions concerning monoids: factorability structure, introduced to simplify the bar complex; and quadratic normalisation, introduced to generalise quadratic rewriting systems and normalisations arising from Garside families. We characterise factorable monoids in the axiomatic setting of quadratic normalisation as monoids admitting quadratic normalisation satisfying a condition stronger than the class (5,4) yet weaker than the class (4,4). We also prove an equivalence between the two assumptions known to ensure the convergence of the rewriting system associated to factorability.

This page was built for publication: Correspondence between factorability and normalisation in monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401056)