A polynomial time knot polynomial

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1708.04853 v3 pith:MWKYCOCD submitted 2017-08-16 math.GT

Dror Bar-Natan , Roland van der Veen This is my paper · ORCID

classification math.GT

keywords polynomialknottimecomputedeffectivelyinvariantknownstrongest

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We present the strongest known knot invariant that can be computed effectively (in polynomial time).

Forward citations

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Quantum topology without topology
math.QA 2025-06 unverdicted novelty 2.0 of 10

A draft of lecture notes presenting quantum invariants as functors from diagrammatically presented categories, aiming to develop quantum topology without topological input.