Informative Words and Discreteness

Abstract

There are certain families of words and word sequences (words in the generators of a two-generator group) that arise frequently in the Teichm\"uller theory of hyperbolic three-manifolds and Kleinian and Fuchsian groups and in the discreteness problem for two generator matrix groups. We survey some of the families of such words and sequences: the semigroup of so called good words of Gehring-Martin, the so called killer words of Gabai-Meyerhoff-NThurston, the Farey words of Keen-Series and Minsky, the discreteness-algorithm Fibonacci sequences of Gilman-Jiang and parabolic dust words. We survey connections between the families and establish a new connection between good words and Farey words.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…