Related papers: Identifying lens spaces in polynomial time
In this note, we reformulate the invariant $\Delta (M, \omega)$ that we defined before, and show its relation with Reidemeister torsion. We calculate $\Delta (M, \omega)$ when the $3$-manifolds are lens spaces, and discuss the…
We present an algorithm for the following problem. Given a triangulated 3-manifold M and a (possibly non-simple) closed curve on the boundary of M, decide whether this curve is contractible in M. Our algorithm runs in space polynomial in…
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
We propose a modification of the three-manifold invariant based on the use of Euclidean metric values ascribed to the elements of manifold triangulation. We thus obtain a nontrivial invariant that can, in particular, distinguish…
We construct new topological invariants of three-dimensional manifolds which can, in particular, distinguish homotopy equivalent lens spaces L(7,1) and L(7,2). The invariants are built on the base of a classical (not quantum) solution of…
We give a concise proof of a classification of lens spaces up to orientation-preserving homeomorphisms. The chief ingredient in our proof is a study of the Alexander polynomial of ` symmetric' links in $S^3$.
We describe an algorithm which, given two essential curves on a surface $S$, computes their distance in the curve graph of $S$, up to multiplicative and additive errors. As an application, we present an algorithm to decide the…
We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
In this paper we study some aspects of knots and links in lens spaces. Namely, if we consider lens spaces as quotient of the unit ball $B^{3}$ with suitable identification of boundary points, then we can project the links on the equatorial…
In an earlier paper of Cadek, Vokrinek, Wagner, and the present authors, we investigated an algorithmic problem in computational algebraic topology, namely, the computation of all possible homotopy classes of maps between two topological…
We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…
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…
Although many machine learning algorithms involve learning subspaces with particular characteristics, optimizing a parameter matrix that is constrained to represent a subspace can be challenging. One solution is to use Riemannian…
Let K be a (2p,q)-torus knot and M_n is a 3-manifold obtained by 1/n-Dehn surgery along K. We consider a polynomial whose zeros are the inverses of the Reideimeister torsion of M_n for SL(2;C)-irreducible representations. Johnson gave a…
We consider several problems that involve lines in three dimensions, and present improved algorithms for solving them. The problems include (i) ray shooting amid triangles in $R^3$, (ii) reporting intersections between query lines…
Consider the problem of determining whether there exists a spanning hypertree in a given k-uniform hypergraph. This problem is trivially in P for k=2, and is NP-complete for k>= 4, whereas for k=3, there exists a polynomial-time algorithm…
The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed…
This paper uses results on the classification of minimal triangulations of 3-manifolds to produce additional results, using covering spaces. Using previous work on minimal triangulations of lens spaces, it is shown that the lens space…
Given the n vertices of a convex polygon in cyclic order, can the triangle of maximum area inscribed in P be determined by an algorithm with O(n) time complexity? A purported linear-time algorithm by Dobkin and Snyder from 1979 has recently…