Finding large counterexamples by selectively exploring the Pachner graph

DOI10.4230/LIPICS.SOCG.2023.21arXiv2303.06321MaRDI QIDQ6509146FDOQ6509146

Authors: Benjamin A. Burton, A. Khe 

Abstract: 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 and hard-to-find counterexamples by using heuristics to selectively (rather than exhaustively) enumerate triangulations. We use this idea to find counterexamples to three conjectures which ask, for certain $3$-manifolds, whether one-vertex triangulations always have a "distinctive" edge that would allow us to recognise the $3$-manifold.

This page was built for publication: Finding large counterexamples by selectively exploring the Pachner graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509146)