Triangulations into Groups

dc.creatorRivin, Igor
dc.date2005-10-27
dc.date.accessioned2026-07-07T06:48:02Z
dc.date.available2026-07-07T06:48:02Z
dc.descriptionIf a (cusped) surface S admits an ideal triangulation T with no shears, we show an efficient algorithm to give S as a quotient of hypebolic plane by a subgroup of PSL(2, Z). The algorithm runs in time O(n log n), where n is the number of triangles in the triangulation T. The algorithm generalizes to producing fundamental groups of general surfaces and geometric manifolds of higher dimension.
dc.description6 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0510613
dc.identifierhttp://arxiv.org/abs/math/0510613
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/103851
dc.subjectGeometric Topology
dc.subjectCombinatorics
dc.subject57M15; 57M50; 57M05; 68w40; 11F06
dc.titleTriangulations into Groups
dc.typetext

Files

Collections