Boundary Algorithms for Thompson Groups
arXiv:2610.07293
Abstract
We construct a deterministic Farey-boundary algorithm converting a cyclic prefix table for an element of into a word in addressed boundary flips. The reduction uses rational boundary pairs and cyclic order, with a marked edge determining the residual modular correction. Its unmarked stage uses at most twice the minimum number of diagonal exchanges. For input size , the complete output has factors, encoded length , and running time . Adjoining shuffles extends the construction to with polynomial bounds. We also give explicit boundary generating sets and their local flip--shuffle relations. Changes of generators in the Lochak--Schneps and Bleak--Quick presentations yield a two-flip presentation of and a presentation of with two flips, one shuffle, and nine relations.
arXiv comment28 pages, 2 figures. Comments are very welcome