Evidence map›Paper›PMID 38192900›Full record

ArticleDiscrete & computational geometry2024

Computing a Link Diagram From Its Exterior.

Nathan M Dunfield, Malik Obeidin, Cameron Gates Rudd

Abstract read
In one paragraph

Article in Discrete & computational geometry, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Computing a Link Diagram From Its Exterior.Discrete & computational geometry · 2024
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Nathan M DunfieldDeptment of Mathematics, University of Illinois Urbana-Champaign, 1409 W. Green Street, Urbana, IL 61801 USA.ORCID 0000-0002-9152-6598
Malik ObeidinGoogle, Inc., Atlanta, GA USA.
Cameron Gates RuddMax-Planck-Institut für Mathematik, Bonn, Germany.ORCID 0000-0001-6065-1110

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by planar diagrams, whereas their exteriors, which are compact 3-manifolds with torus boundary, are encoded by triangulations. Here, we give the first practical algorithm for finding a diagram of a knot given a triangulation of its exterior. Our method applies to links as well as knots, and allows us to recover links with hundreds of crossings. We use it to find the first diagrams known for 23 principal congruence arithmetic link exteriors; the largest has over 2500 crossings. Other applications include finding pairs of knots with the same 0-surgery, which relates to questions about slice knots and the smooth 4D Poincaré conjecture.

Indexed as

Computational topologyKnotKnot diagramKnot exteriorLinkLink diagramLink exteriorLow-dimensional topology

Identifiers

PMID38192900
PMCPMC10771428

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.