vix.ing · top · new · best · stats · spec

Factorability, String Rewriting and Discrete Morse Theory

2014/12/09 by Alexander Heß, Heß, Alexander, Viktoriya Ozornova +1
Mathematics · #20F05 (Primary) 20J06 #20F10 #20F36 #20M05 #57T30 #68Q42 #Algebraic Topology (math.AT) #Algebraic structures and combinatorial models #FOS: Mathematics #Geometric and Algebraic Topology #Group Theory (math.GR) #Homotopy and Cohomology in Algebraic Topology #math.AT #math.GR #msc:20F05 #msc:20F10 #msc:20F36 #msc:20J06 #msc:20M05 #msc:57T30 #msc:68Q42

paper · pdf · doi:10.48550/arxiv.1412.3025

arxiv created 2014/12/09 · openalex publication_date 2014/12/09 · arxiv updated 2014/12/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

Related