Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,618

The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.

A polynomial invariant for knots via von Neumann algebras

Open access
Jones, Vaughan F. R.·1985·Bulletin of the American Mathematical Society

Abstract

A theorem of J. Alexander [1] asserts that any tame oriented link in 3-space may be represented by a pair (6, n), where b is an element of the n-string braid group B n .The link L is obtained by closing 6, i.e., tying the top end of each string to the same position on the bottom of the braid as shown in Figure 1.The closed braid will be denoted b A .Thus, the trivial link with n components is represented by the pair (l,n), and the unknot is represented by (si$2 * * • s n -i, n) for any n, where si, $2, • • • > s n _i are the usual generators for B n .The second example shows that the correspondence of (b, n) with b A is many-to-one, and a theorem of A. Markov [15] answers, in theory, the question of when two braids represent the same link.A Markov move of type 1 is the replacement of (6, n) by (gbg~x, n) for any element g in B n , and a Markov move of type 2 is the replacement of (6, n) by (6s J 1 , n-hl).Markov's theorem asserts that (6, n) and (c, ra) represent the same closed braid (up to link isotopy) if and only if they are equivalent for the equivalence relation generated by Markov moves of types 1 and 2 on the disjoint union of the braid groups.Unforunately, although the conjugacy problem has been solved by F. Garside [8] within each braid group, there is no known algorithm to decide when (6, n) and (c, m) are equivalent.For a proof of Markov's theorem see J. Birman's book [4].The difficulty of applying Markov's theorem has made it difficult to use braids to study links.The main evidence that they might be useful was the existence of a representation of dimension n -1 of B n discovered by W. Burau in [5].The representation has a parameter t, and it turns out that the determinant of 1-(Burau matrix) gives the Alexander polynomial of the closed braid.Even so, the Alexander polynomial occurs with a normalization which seemed difficult to predict.In this note we introduce a polynomial invariant for tame oriented links via certain representations of the braid group.That the invariant depends only on the closed braid is a direct consequence of Markov's theorem and a certain trace formula, which was discovered because of the uniqueness of the trace on certain von Neumann algebras called type Hi factors.Notation.In this paper the Alexander polynomial A will always be normalized so that it is symmetric in t and t~l and satisfies A(l) = 1 as in Conway's tables in [6].

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1090/s0273-0979-1985-15304-2

Cites

12 of 12 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 12 references

Cited by

See all 1,618

Metadata

Authors
Jones, V. F. R.
Venue
Bulletin of the American Mathematical Society
Published
1985
Volume
12
Issue
1
Pages
103-111
ISSN
  • 0002-9904 (ISSN-L)
  • 0273-0979
  • 1088-9485
OpenAlex
W2091919572
Cited by
1,618
References
12
FWCI
43.31
Type
journal article
Language
en
Open access
diamond

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A polynomial invariant for knots via von Neumann algebras. https://app.cochat.ai/papers/10.1090/s0273-0979-1985-15304-2
The paper
Jones, V. F. R. (1985). A polynomial invariant for knots via von Neumann algebras. Bulletin of the American Mathematical Society. https://doi.org/10.1090/s0273-0979-1985-15304-2

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.