Algorithmic characterizations of hyperbolicity via quasigeodesics
Abstract
Gromov-hyperbolic groups are classically defined geometrically, by the negative curvature of their Cayley graphs. Interestingly, an algorithmic characterization of hyperbolicity is possible in terms of properties of the formal languages of quasigeodesics (geodesics up to bounded error) in their Cayley graphs. Holt and Rees proved, roughly speaking, that these formal languages are regular in the case of hyperbolic groups. More recently Hughes, Nairne, and Spriano established the converse. In this talk, I will discuss progress towards a conjectured strengthening of the result, where we consider context-free quasigeodesic languages. This is based on my summer project, supervised by Joseph MacManus and Davide Sprianoc