Hostname: page-component-77f85d65b8-g98kq Total loading time: 0 Render date: 2026-04-21T08:41:19.630Z Has data issue: false hasContentIssue false

More interlinked loops

Published online by Cambridge University Press:  01 August 2016

W. R. Brakes
Affiliation:
The University of Northampton, Moulton Park, Northampton NN3 7AL email: billl40347@btinternet.com
G. C. Shephard
Affiliation:
School of Mathematics, University of East Anglia, Norwich NR4 7TJ email: G.C.Shephard@uea.ac.uk
Get access

Extract

In the second named author presented some results and problems concerning interlinked loops. These were ‘inspired’ by the well-known Borromean rings – three loops with the property that they are interlinked, but if we cut and remove any one of the loops, then the remaining two loops are not linked and so can be separated.

To conform more closely with standard terminology in this area we shall here use the term ‘link of n components’ to denote such a set of loops (rather than linkage). In all the cases we consider, the individual loops that make up each link are unknotted.

Information

Type
Articles
Copyright
Copyright © The Mathematical Association 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable