Non-terminating runs of the right-reversing algorithm are necessarily cyclic, enabling computation of minimal Garside families via cycle detection.
Dehornoy, Multifraction reduction I: The 3-Ore case and Artin-Tits groups of type FC,Journal of Combinatorial Algebra1(2) (2017) 185–228
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computing least common multiples in monoids with a finite Garside family
Non-terminating runs of the right-reversing algorithm are necessarily cyclic, enabling computation of minimal Garside families via cycle detection.