Home
File Metadata
q-alg_9501022.txt
Annotation: dorsal/arxiv

dorsal/arxiv

Added by Arxiv Bot | Added: 2026-03-02 18:01 | Views: 1 | Source: arXiv Dataset IDs (Model)

Is a Knot Classification possible?

Authors	Charilaos Aneziris
Categories	q-alg alg-geom hep-th math.AG math.QA
ArXiv ID	q-alg/9501022
URL	https://arxiv.org/abs/q-alg/9501022

Abstract

The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed self-avoiding walks.

{
  "annotation_id": "1a6cc3e5-69d4-443e-8506-6251664a4f68",
  "date_created": "2026-03-02T18:01:25.356000Z",
  "date_modified": "2026-03-02T18:01:25.356000Z",
  "file_hash": "e59671220a354f5ea16500a74a042865fad6a721f7b59f3b47ec5215063790cf",
  "private": false,
  "record": {
    "abstract": "The goal of this paper is to discuss the possibility of finding an algorithm\nthat can give all distinct knots up to a desired complexity. Two such\nalgorithms are presented, one based on projections on a plane, the other on\nclosed self-avoiding walks.",
    "arxiv_id": "q-alg/9501022",
    "authors": [
      "Charilaos Aneziris"
    ],
    "categories": [
      "q-alg",
      "alg-geom",
      "hep-th",
      "math.AG",
      "math.QA"
    ],
    "title": "Is a Knot Classification possible?",
    "url": "https://arxiv.org/abs/q-alg/9501022"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2262a1f8-a48a-4f4b-8324-036949295905",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}