An algorithmic approach to construct crystallizations of 3-manifolds from presentations of fundamental groups

From MaRDI portal
Publication:345698

DOI10.1007/S12044-016-0302-7zbMATH Open1362.57032arXiv1410.5917OpenAlexW3101865903MaRDI QIDQ345698FDOQ345698


Authors: Biplab Basak Edit this on Wikidata


Publication date: 2 December 2016

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Abstract: We have defined weight of the pair (langleSmidRangle,R) for a given presentation langleSmidRangle of a group, where the number of generators is equal to the number of relations. We present an algorithm to construct crystallizations of 3-manifolds whose fundamental group has a presentation with two generators and two relations. If the weight of (langleSmidRangle,R) is n then our algorithm constructs all the n-vertex crystallizations which yield (langleSmidRangle,R). As an application, we have constructed some new crystallizations of 3-manifolds. We have generalized our algorithm for presentations with three generators and certain class of relations. For mgeq3 and mgeqngeqkgeq2, our generalized algorithm gives a 2(2m+2n+2k6+deltan2+deltak2)-vertex crystallization of the closed connected orientable 3-manifold Mlanglem,n,kangle having fundamental group langlex1,x2,x3midx1m=x2n=x3k=x1x2x3angle. These crystallizations are minimal and unique with respect to the given presentations. If `n=2' or `kgeq3 and mgeq4' then our crystallization of Mlanglem,n,kangle is vertex-minimal for all the known cases.


Full work available at URL: https://arxiv.org/abs/1410.5917




Recommendations




Cites Work


Cited In (5)





This page was built for publication: An algorithmic approach to construct crystallizations of 3-manifolds from presentations of fundamental groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345698)