Year: 2026
Type: article
Abstract: Right-reversing is an algorithm used to compute least common multiples in monoids that admit a right-complemented presentation. The algorithm can either terminate and find a result, fail, or run indefinitely. The correctness of the algorithm can be proved with additional assumptions coming from Garside theory. In the same framework, we prove that a nonterminating run of the algorithm is necessarily cyclic. Stopping when a cycle is detected provides a way of computing a minimal Garside family.
Author: Emir Melliti
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7154573720