Identifying lens spaces in polynomial time
classification
🧮 math.GT
quant-ph
keywords
lenspolynomialtimealgorithmanalysiscalculateclosedcomplex
read the original abstract
We show that if a closed, oriented 3-manifold M is promised to be homeomorphic to a lens space L(n,k) with n and k unknown, then we can compute both n and k in polynomial time in the size of the triangulation of M. The tricky part is the parameter k. The idea of the algorithm is to calculate Reidemeister torsion using numerical analysis over the complex numbers, rather than working directly in a cyclotomic field.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.