Word Length Formulae and Normal Forms of Conjugacy Classes in Surface Groups
Abstract
In this paper, we primarily investigate the following symmetric presentation of the surface group π1(g)= c1,…, c2g c1·s c2gc1-1·s c2g-1. For every nontrivial element x∈ π1(g), we obtain a uniform representation of the normal forms of xk under the length-lexicographical order. Based on this, we find a new relation among these normal forms, and then derive the following three formulae related to the word length: |x2|>|x|; |xk|=(k-1)(|x2|-|x|)+|x|; k∞|xk|k=|x2|-|x|. Moreover, we extend these results to obtain analogous but less precise formulae for every minimal geometric presentation. Then, we define the normal forms of conjugacy classes in π1(g) and give a criterion for determining the conjugacy of elements. As a consequence, we give efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications concerning the computation of some growth rates.
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.