Alen Đurić
Published 2022-06-03Version 1
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.
On correspondence between right near-domains and sharply 2-transitive groups
Factorability, String Rewriting and Discrete Morse Theory
Polynomially weighted $\ell^p$-completions and group homology
![QR code for arXiv:2206.01672 [math.GR]](http://oss.arxitics.com/images/favicon.svg)