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 …

Hyperbolic 3-manifolds whose fundamental groups are subgroups of finite index in right-
angled Coxeter groups are under consideration. The construction of such manifolds is …

Как известно [1; гл. 1, § 2], в 1890 г. Ф. Клейн, вдохновленный некоторыми примерами
УК Клиффорда, поставил проблему описания всех связных компактных римановых …

The triangulation complexity of a closed orientable 3-manifold is the minimal number of
tetrahedra in any triangulation of the manifold. The main theorem of the paper gives upper …

$$\mathbb Z _2$$ -Thurston norm and complexity of 3-manifolds | SpringerLink Skip to main
content Advertisement SpringerLink Log in Menu Find a journal Publish with us Search Cart …

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 …

Enumerating all 3-manifold triangulations of a given size is a difficult but increasingly
important problem in computational topology. A key difficulty for enumeration algorithms is …

The present paper follows the computational approach to 3-manifold classification via edge-
colored graphs, already performed in [1](with respect to orientable 3-manifolds up to 28 …

We prove that a closed smooth 4-manifold has shadow-complexity zero if and only if it is a
kind of four-dimensional graph manifold, which decomposes into some particular blocks …

Drawing together techniques from combinatorics and computer science, we improve the
census algorithm for enumerating closed minimal P 2 3-manifold triangulations. In particular …