{
  "schema_version": 1,
  "problem_number": "AMR-105-0051",
  "title": "Free Knots and Links with Two Minimal Representatives: Explicit Examples for a Problem of Fenn, Ilyutko, Kauffman and Manturov",
  "author": {
    "name": "Alper Ferudun",
    "affiliation": "Mercury Software GmbH",
    "url": "https://github.com/AlperTheKing"
  },
  "abstract": "Problem 51 of the list of unsolved problems in virtual knot theory and combinatorial knot theory by Fenn, Ilyutko, Kauffman and Manturov (2014) asks to prove or disprove the conjecture that some free link has several minimal representatives, that is, non-isomorphic diagrams with the least number of vertices. We prove that the free knot with the Gauss word a b a e c b d f d g e g c f has exactly two minimal representatives: this diagram and the diagram a b a c e b d f d e g c g f, obtained from it by one third Reidemeister move, both with seven vertices. The same holds for the two-component free link given by the words e 1 e 3 5 2 6 4 and 1 2 3 4 5 6. Equivalence and non-isomorphism are elementary. The lower bound of seven vertices follows from Manturov's parity bracket, whose invariance we prove: each diagram has exactly one even crossing, and its bracket has two different terms, one of them an irreducible graph on the six odd crossings. That there are exactly two minimal representatives is computer-assisted; it rests on the computation of the bracket of all diagrams with seven vertices by independent programs. Kauffman and Manturov anticipated the mechanism: they observed that a diagram with a triangle is equivalent to its image under the third move, that the two can have the same unoriented state, and that minimal diagrams with triangles can be constructed; their minimality criterion, applied to a suitable explicit diagram, also answers the question. The problem list still states the conjecture. To our knowledge this is the first explicit written example with a self-contained proof; no explicit example was found in the literature accessible to us. Minimal representatives that are not related by third moves are not treated. This is an unrefereed note.",
  "result_type": "COMPLETE_PROOF",
  "categories": [
    "math.GT",
    "math.CO"
  ],
  "keywords": [
    "free knots",
    "free links",
    "framed 4-graphs",
    "Gauss words",
    "minimal diagrams",
    "minimal representatives",
    "parity",
    "parity bracket",
    "third Reidemeister move",
    "virtual knot theory",
    "computer-assisted proof",
    "Fenn-Ilyutko-Kauffman-Manturov problem list",
    "UnsolvedMath",
    "AMR-105-0051",
    "math.GT",
    "math.CO",
    "open mathematics"
  ],
  "manuscript_version_date": "2026-10-14",
  "publication_date": "2026-10-14",
  "publication_date_kind": "first public online release",
  "version": "1.0",
  "date_modified": "2026-10-14",
  "presentation_revision_only": false,
  "doi_archived_file_version": "1.0",
  "status": "unrefereed preprint",
  "canonical_url": "https://eulersolve.org/papers/amr-105-0051/",
  "pdf_url": "https://eulersolve.org/papers/amr-105-0051/paper.pdf?v=3d8b1f07e083",
  "doi": "10.5281/zenodo.23366093",
  "zenodo_record_url": "https://zenodo.org/records/23366093",
  "license": "https://creativecommons.org/licenses/by/4.0/",
  "scope_caveat": "Answers Problem 51 of Fenn, Ilyutko, Kauffman and Manturov (2014): an explicit free knot and an explicit two-component free link, each with exactly two minimal representatives (seven vertices), related by one third Reidemeister move; minimality by Manturov's parity bracket; the count 'exactly two' is computer-assisted. Kauffman and Manturov anticipated the mechanism without an explicit example. Minimal representatives not related by third moves are not treated. Novelty is not certified.",
  "files": {
    "paper.pdf": {
      "sha256": "3d8b1f07e08319ee779ee21f6308ba19b813054e0b57e8cea09ef095c4adcf9f"
    },
    "source.zip": {
      "sha256": "66b7b351a7142eec813d395fdf1f9f3c922cfb1685ad2d685aef1aeef58024a2"
    },
    "verification_report.md": {
      "sha256": "75a2e5a88a14b3ce287059f288ec21a96b6aee3b9a256cdc1abb65c17817df07"
    }
  },
  "ai_use_disclosure": "AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text."
}