HackerPapers

arXiv:math/9712269math.GT

Algorithms for recognizing knots and 3-manifolds

Joel Hass

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

This is a survey paper on algorithms for solving problems in 3-dimensional topology. In particular, it discusses Haken's approach to the recognition of the unknot, and recent variations.

arXiv comments
17 Pages, 7 figures, to appear in Chaos, Fractals and Solitons
Journal reference
DOI
doi:10.1016/S0960-0779(97)00109-4
Subjects
math.GTGeometric Topology

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from May 2015 to May 2015.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Inventing an algebraic knot theory for eight year olds (III) 1 comment

    • From a browse on wikipedia it looks like knot equivalence is decidable. If I'm reading [1] correctly however, it looks like strong bounds on the complexity of knot equivalence in general haven't been found. [1] http://arxiv.org/abs/math/9712269

      14113View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.