Generation of Catalogues of PL n-manifolds: Computational Aspects on HPC Systems

Within mathematical research, Geometric Topology deals with the study of piecewise-linear n-manifolds, i.e. triangulable spaces which appear locally as the $n$-dimensional Euclidean space. This paper reports on the computational aspects of an algorithm for generating triangulations of PL 3- and 4-manifolds represented by edge-coloured graphs. As the number of graph vertices is increased the algorithm becomes computationally expensive very quickly, making it a natural candidate for the usage of HPC resources. We present an optimized, parallel version of the algorithm that is suitable for deployment of multi-core systems. Scalability results are discussed on two different platforms, namely an IBM iDataPlex Linux cluster and the IBM supercomputer BlueGene/Q.

[1]  Benjamin A. Burton.  Enumeration of Non-Orientable 3-Manifolds Using Face-Pairing Graphs and Union-Find , 2006, Discret. Comput. Geom..

[2]  Michael H. Freedman,et al.  The topology of four-dimensional manifolds , 1982 .

[3]  Peter Hilton,et al.  Homology Theory: An Introduction to Algebraic Topology , 1960 .

[4]  C. Gagliardi,et al.  RIGID GEMS IN DIMENSION N , 2011, 1105.0507.

[5]  Richard Mandelbaum,et al.  Four-dimensional topology: an introduction , 1980 .

[6]  M. R. Casali,et al.  A Code for m-Bipartite Edge-Coloured Graphs , 2001 .

[7]  B. Park,et al.  Exotic smooth structures on small 4-manifolds with odd signatures , 2007, math/0701829.

[8]  Carlo Gagliardi,et al.  A graph-theoretical representation of PL-manifolds — A survey on crystallizations , 1986 .

[9]  Sergey Nikitin.  On 3-manifolds , 2005 .

[10]  Rajeev Thakur,et al.  Revealing the Performance of MPI RMA Implementations , 2007, PVM/MPI.

[11]  Sóstenes Lins,et al.  Gems, Computers and Attractors for 3-Manifolds , 1995 .

[12]  A. White.  Graphs, Groups and Surfaces , 1973 .

[13]  M. R. Casali.  Catalogues of PL-manifolds and complexity estimations via crystallization theory , 2012 .

[14]  Benjamin A. Burton.  Pachner moves, generic complexity, and randomising 3-manifold triangulations , 2012 .

[15]  C. Rourke,et al.  Introduction to Piecewise-Linear Topology , 1972 .

[16]  P. Cristofori,et al.  NON-ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH AT MOST 30 TETRAHEDRA , 2007, 0705.1487.

[17]  Luigi Grasselli,et al.  Computational aspects of crystallization theory: complexity, catalogues and classifications of 3-manifolds , 2011 .

[18]  M. R. Casali,et al.  A catalogue of orientable 3-manifolds triangulated by 30 coloured tetrahedra , 2006 .

[19]  M. R. Casali,et al.  Representing manifolds by crystallization theory: foundations, improvements and related results , 2001 .

[20]  S. Matveev,et al.  Recognition and tabulation of 3-manifolds , 2005 .

[21]  Сергей Владимирович Матвеев,et al.  Табулирование трехмерных многообразий@@@Tabulation of three-dimensional manifolds , 2005 .