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)=\left\langle c_1,\dots, c{2g}\mid c_1\cdots c_{2g}c_1{-1}\cdots c_{2g}{-1}\right\rangle$. For every nontrivial element $x\in π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|$; $\lim{k\to\infty}\frac{|xk|}{k}=|x2|-|x|$. Moreover, we extend these results to obtain analogous but less precise formulae for every minimal geometric presentation. Finally, 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.