Factorability, String Rewriting and Discrete Morse Theory
classification
🧮 math.GR
math.AT
keywords
complexfactorabilitytheorydiscretemorserewritingstringarticle
read the original abstract
This article deals with the notion of factorability. Elements of a factorable group or monoid possess a normal form, which leads to a small complex homotopy equivalent to its bar complex, thus computing its homology. We investigate the relations to string rewriting and to discrete Morse theory on the bar complex. Furthermore, we describe a connection between factorability and Garside theory.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.