This program lists all triangulations of closed surfaces with at most 11 vertices.
It is an Objective Caml program, hence it needs an Objective Caml compiler.
The program is based on the algorithm described in the paper "Decomposition and Enumeration of Triangulated Surfaces" (arxiv:0705.1835) and uses the theory of roots, decompositions, and genus-surfaces.
The amount of RAM needed depends on the maximal number of vertices. If this number is at most 10, then 512 MB are enough (but maybe 256 MB are also enough). If the number is 11, then the program runs on a laptop with 3 GB (but maybe 2 GB are enough).
The amount of disc space needed depends on the maximal number of vertices. If this number is at most 10, then 5 MB are enough. If the number is 11, then 2 GB are enough.
The processor speed should only make the listing faster. The program has been tested on a 1.6 GHz (up to 10 vertices) and on a 2.33 GHz laptop (up to 11 vertices), working properly.
This program has been developed under Linux and it has been tested under Linux and under Mac OS X, but it should run also under Microsoft Windows (if someone will be able to, please tell me so that I can complete this page).
Download the archive trialistgs11.tar.gz.
Open a terminal (xterm, konsole, aterm, ...).
Enter the directory in which you have saved the file trialistgs11.tar.gz (something like cd ~/Documents/).
Extract the archive trialistgs11.tar.gz (something like tar -xzvf trialistgs11.tar.gz).
Enter the directory in which you have extracted the archive trialistgs11.tar.gz (something like cd ~/Documents/trialistgs11/).
Read the README file and follow the instructions in it.
The numbers of triangulations found is shown here. Namely, for each topological type of the surface, it is shown the displayed output of the program for that type, and it is also shown the output of the command time. The complete lists of triangulations (being too big) are available upon request.
Copyright 2007 Gennaro Amendola