Collapsing Abstract Simplicial Complexes
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
Makefile
README.md
accx.dat
asc.c
asc.h
asc_test.c
collapse.c
collapse.h
common.c
common.h
dhat-new.dat
duncehat-1.dat
duncehat-2.2.dat
duncehat-2.dat
history.c
history.h
ht.c
ht.h
input.c
input.h
main.c
main_rand.c
simplex.c
simplex.h
simplex_ff.c
simplex_ff.h

README.md

ASC, Software For Collapsing Abstract Simplicial Complexes

ASC was written by Sean Bowman in 2006. It contains code for storing and working with abstract simplicial complexes, especially implementing Whitehead's simplicial collapsing. ASC was written to investigate the Zeeman conjecture. Sadly, all I really found out is that collapsing simplicial complexes takes a lot of time.

There are some tests in asc_test.c, and the main program reads a simplicial complex and tries to collapse it to something small. The input format is a text file containing a list of simplicies, one on each line. Vertices are represented by integers, and the current implementation only allows simplices of dimension three and below. For example, you can specify a triangle with

0 1
1 2
0 2

The main program uses depth first search to try to collapse the given complex to a point. The program main_rand collapses simplices with free faces randomly.

This program is licensed under the GPL.