ID: 1903.09532

Experiments with the Census

March 16, 2019

View on ArXiv

Similar papers 5

3-Manifold triangulations with small treewidth

December 13, 2018

82% Match
Kristóf Huszár, Jonathan Spreer
Geometric Topology
Computational Geometry
Combinatorics

Motivated by fixed-parameter tractable (FPT) problems in computational topology, we consider the treewidth of a compact, connected 3-manifold $M$ defined by \[ \operatorname{tw}(M) = \min\{\operatorname{tw}(\Gamma(\mathcal{T})):\mathcal{T}~\text{is a triangulation of }M\}, \] where $\Gamma(\mathcal{T})$ denotes the dual graph of $\mathcal{T}$. In this setting the relationship between the topology of a 3-manifold and its treewidth is of particular interest. First, as a cor...

Find SimilarView on arXiv

Excluding cosmetic surgeries on hyperbolic 3-manifolds

March 15, 2024

82% Match
David Futer, Jessica S. Purcell, Saul Schleimer
Geometric Topology

This paper employs knot invariants and results from hyperbolic geometry to develop a practical procedure for checking the cosmetic surgery conjecture on any given one-cusped manifold. This procedure has been used to establish the following computational results. First, we verify that all knots up to 19 crossings, and all one-cusped 3-manifolds in the SnapPy census, do not admit any purely cosmetic surgeries. Second, we check that a hyperbolic knot with at most 15 crossings on...

Find SimilarView on arXiv

Minimal Triangulations of Manifolds

January 25, 2007

82% Match
Basudeb Datta
Geometric Topology
Combinatorics

In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a given pl manifold. (ii) Given positive integers $n$ and $d$, construction of $n$-vertex triangulations of different $d$-dimensional pl manifolds. (iii) Classifications of all the triangulations of a given pl manifold with same number of ver...

Find SimilarView on arXiv

An experimental investigation of Neumann's conjecture

September 28, 2016

82% Match
Stephen Gilles, Peter Huston
Geometric Topology

We use a large census of hyperbolic 3-manifolds to experimentally investigate a conjecture of Neumann regarding the Bloch Group. We present an augmented census including, for feasible invariant trace fields, explicit manifolds (associated to that field) that appear to generate the Bloch group of that field. We also make use of Ptolemy coordinates to compute "exotic volumes" of representations, and attempt to realize these volumes as linear combinations of generator volumes. W...

Find SimilarView on arXiv

Classification of digital n-manifolds

November 29, 2014

82% Match
Alexander V. Evako
Discrete Mathematics

This paper presents the classification of digital n-manifolds based on the notion of complexity and homotopy equivalence. We introduce compressed n-manifolds and study their properties. We show that any n-manifold with p points is homotopy equivalent to a compressed n-manifold with m points, m<p. We design an algorithm for the classification of digital n-manifolds of any dimension n.

Find SimilarView on arXiv

Finding large counterexamples by selectively exploring the Pachner graph

March 11, 2023

82% Match
Benjamin A. Burton, Alexander He
Geometric Topology
Computational Geometry

We often rely on censuses of triangulations to guide our intuition in $3$-manifold topology. However, this can lead to misplaced faith in conjectures if the smallest counterexamples are too large to appear in our census. Since the number of triangulations increases super-exponentially with size, there is no way to expand a census beyond relatively small triangulations; the current census only goes up to $10$ tetrahedra. Here, we show that it is feasible to search for large an...

Find SimilarView on arXiv

The Homeomorphism Problem For Hyperbolic Manifolds I

August 2, 2021

82% Match
Joe Scull
Geometric Topology

We give a bounded runtime solution to the homeomorphism problem for closed hyperbolic 3-manifolds. This is an algorithm which, given two triangulations of hyperbolic 3-manifolds by at most $t$ tetrahedra, decides if they represent the same hyperbolic 3-manifold with runtime bounded by \[ 2^{2^{t^{O(t)}}}.\] We do this by first finding a hyperbolic structure on each manifold given as a geometric triangulation and then comparing the two as geometric manifolds.

Find SimilarView on arXiv

Complex network view of evolving manifolds

August 7, 2017

82% Match
Silva Diamantino C. da, Ginestra Bianconi, Costa Rui A. da, ... , Mendes José F. F.
Physics and Society
Disordered Systems and Neura...

We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by the condition that at each step, all the faces must be triangles. Stochastic application of these operations leads to random networks with different architectures. We perform extensive numerical simulations and explore the geometries of gr...

Find SimilarView on arXiv

Survey on L^2-invariants and 3-manifolds

February 8, 2021

82% Match
Wolfgang Lueck
Geometric Topology

In this paper give a survey about L^2-invariants focusing on 3-manifolds.

Find SimilarView on arXiv

Hyperbolic 3-manifolds with geodesic boundary: Enumeration and volume calculation

November 5, 2004

82% Match
Alexander Mednykh, Carlo Petronio
Geometric Topology

We describe a natural strategy to enumerate compact hyperbolic 3-manifolds with geodesic boundary in increasing order of complexity. We show that the same strategy can be employed to analyze simultaneously compact manifolds and finite-volume manifolds having toric cusps. In opposition to this we show that, if one allows annular cusps, the number of manifolds grows very rapidly, and that our strategy cannot be employed to obtain a complete list. We also carefully describe how ...

Find SimilarView on arXiv