z-logo
Premium
Some Non‐Fibred 3‐Knots
Author(s) -
Kearton C.
Publication year - 1983
Publication title -
bulletin of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.396
H-Index - 48
eISSN - 1469-2120
pISSN - 0024-6093
DOI - 10.1112/blms/15.4.365
Subject(s) - citation , fibered knot , computer science , mathematics , information retrieval , artificial intelligence , library science , combinatorics
It is well known that a simple n-knot, n > 3, is fibred if and only if the leading coefficient of its Alexander polynomial is + 1 . This can be proved directly by doing ambient surgery on a Seifert surface of the knot, in the manner of J. Levine [6], or by using the fibration theorem of W. Browder and J. Levine [2, Corollary 1.6]. Using a recent result of S. K. Donaldson [3], concerning the intersection form on a smooth closed simply-connected 4-manifold, we are able to construct examples of simple 3-knots which satisfy the condition above but are not fibred. As a corollary, we see at once that the Browder-Levine fibration theorem does not extend to dimension 5. Furthermore, it follows easily that the quasi-fibring conjecture for 5-manifolds (with infinite-cyclic fundamental group), and the smoothing conjecture for simplyconnected finite Poincare complexes in dimension 4 also fail. For details of both these conjectures the reader is referred to [7]. An n-knot k is a smooth pair (S" + , Z") where Z" is homeomorphic to the n-sphere S". Let K denote the exterior of k; that is, the complement of an open tubular neighbourhood of I " in S" + . The knot k is said to be fibred if K fibres smoothly over S. The {2q— l)-knot k is simple if n^K) ^ ^.(S) for 1 ^ i < q\ for q ^ 2, such knots have been classified in terms of the S-equivalence class of the Seifert matrix (see [6] for details). There exists a 16 x 16 integer matrix A with the following properties (i) det(A + A') = 1 (ii) signature {A + A') = 16 (iii) detA = 1.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here