Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:researchbank.rmit.edu.au:rmit:414

Enumeration of non-orientable 3-manifolds using face-pairing graphs and union find

Authors
Publication date
2007
Publisher
Springer (New York, USA)

Abstract

Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P-2-irreducible 3-manifold triangulations. In particular, new constraints are proven for face-pairing graphs, and pruning techniques are improved using a modification of the union-find algorithm. Using these results we catalogue all 136 closed non-orientable P-2-irreducible 3-manifolds that can be formed from at most 10 tetrahedra

Similar works

Full text

thumbnail-image

RMIT Research Repository

redirect
oaioai:researchbank.rmit.edu.au:r...
Last time updated on 04/09/2013

This paper was published in RMIT Research Repository.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.