Restrictions on Potential Automatic Structures on Thompson's Group F

Original · EN

We show that a large class of languages in the standard finite generating set X = x₀, x₁, x₀⁻¹, x₁⁻¹ cannot be part of an automatic structure for Thompson's Group F. These languages are ones that accept at least one representative of each element of F of word length that is within a fixed constant of a geodesic representative of the element. To accomplish this, we look at a specific element of F and trace two different paths through the Cayley graph to that element. We show that staying within the length restrictions along these two paths would force that element to have contradictory properties.