Let $P$ be a compact convex polyhedron in $\mathbb{H}^3$. Let $G$ be a group generated by side-pairing isometries of $P$. Is there an algorithm to find the rank of $G$?
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
5
I assume that you want $P$ to be a fundamental domain for $G$. Then the answer is positive, see:
I. Kapovich, R. Weidmann, Kleinian groups and the rank problem. Geom. Topol. 9 (2005), 375-402.
-
$\begingroup$ Do you know of a practical algorithm? $\endgroup$– b bCommented Mar 4, 2012 at 18:29
-
3$\begingroup$ This algorithm is as practical as any in 3d topology and geometric group theory. None of these you would want to implement on your computer. $\endgroup$– MishaCommented Mar 4, 2012 at 19:10
-
$\begingroup$ The obvious question is: what is the application? In practice, there are often heuristics which work quite fast. $\endgroup$ Commented Mar 4, 2012 at 21:39
-
$\begingroup$ I was curious about whether one could determine some properties of the polyhedron that would imply the difference between the rank of the group and the number of side-pairings was bounded. $\endgroup$– b bCommented Mar 5, 2012 at 2:53
-
2$\begingroup$ Even for cyclic groups, the number of faces of convex (Dirichlet) fundamental polyhedron could be arbitrarily high, see T. Drumm, J. Poritz, Ford and Dirichlet fundamental domains for cyclic subgroups of $PSL(2; C)$, Conformal Geometry and Dynamics, 3 (1999) 116-150. Short of taking a group generated by reflections, I do not think there are nice reasonably general conditions to ensure a relation between rank and the number of faces. $\endgroup$– MishaCommented Mar 5, 2012 at 3:38