[图书][B] Algorithmic topology and classification of 3-manifolds

SV Matveev, SV Matveev - 2007 - Springer
The book is devoted to algorithmic low-dimensional topology. This branch of mathematics
has recently been undergoing an intense development. On the one hand, the exponential …

Layered-triangulations of 3-manifolds

W Jaco, JH Rubinstein - arXiv preprint math/0603601, 2006 - arxiv.org
A family of one-vertex triangulations of 3-manifolds, layered-triangulations, is defined.
Layered-triangulations are first described for handlebodies and then extended to all 3 …

Three-manifolds having complexity at most 9

B Martelli, C Petronio - Experimental Mathematics, 2001 - Taylor & Francis
We describe an algorithm which has enabled us to give a complete list, without repetitions,
of all closed oriented irreducible three-manifolds of complexity up to 9. More interestingly …

f-vectors of 3-manifolds

FH Lutz, T Sulanke, E Swartz - arXiv preprint arXiv:0805.1144, 2008 - arxiv.org
In 1970, Walkup completely described the set of $ f $-vectors for the four 3-manifolds $ S^
3$, $ S^ 2 twist S^ 1$, $ S^ 2\times S^ 1$, and $ RP^ 3$. We improve one of Walkup's main …

Introducing Regina, the 3-manifold topology software

BA Burton - Experimental Mathematics, 2004 - Taylor & Francis
An overview is presented of Regina, a freely available software package for 3-manifold
topologists. In addition to working with 3-manifold triangulations, Regina includes support for …

A new approach to crushing 3-manifold triangulations

BA Burton - Proceedings of the twenty-ninth annual symposium on …, 2013 - dl.acm.org
The crushing operation of Jaco and Rubinstein is a powerful technique in algorithmic 3-
manifold topology: it enabled the first practical implementations of 3-sphere recognition and …

The triangulation complexity of elliptic and sol 3-manifolds

M Lackenby, JS Purcell - Mathematische Annalen, 2024 - Springer
The triangulation complexity of elliptic and sol 3-manifolds | Mathematische Annalen Skip to
main content SpringerLink Account Menu Find a journal Publish with us Track your research …

The complexity of detecting taut angle structures on triangulations

BA Burton, J Spreer - Proceedings of the Twenty-Fourth Annual ACM-SIAM …, 2013 - SIAM
There are many fundamental algorithmic problems on triangulated 3-manifolds whose
complexities are unknown. Here we study the problem of finding a taut angle structure on a …

[PDF][PDF] Exact values of complexity for an infinite number of 3-manifolds

SS Anisov - Moscow Mathematical Journal, 2005 - scholar.archive.org
EXACT VALUES OF COMPLEXITY FOR AN INFINITE NUMBER OF 3-MANIFOLDS The
notion of complexity of 3-dimensional manifolds (see Defini Page 1 MOSCOW …

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

BA Burton - Discrete & Computational Geometry, 2007 - Springer
Drawing together techniques from combinatorics and computer science, we improve the
census algorithm for enumerating closed minimal P 2 3-manifold triangulations. In particular …