A Brunnian link is a set of n linked loops such that every proper sublink is trivial. Simple Brunnian links have a natural algebraic representation. This is used to determine the form, length and number of minimal simple Brunnian links. Braids are used to investigate when two algebraic words represent equivalent simple Brunnian links that differ only in the arrangement of the component loops.
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-fm193-3-3,
author = {Paul Gartside and Sina Greenwood},
title = {Brunnian links},
journal = {Fundamenta Mathematicae},
volume = {193},
year = {2007},
pages = {259-276},
zbl = {1111.57006},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-fm193-3-3}
}
Paul Gartside; Sina Greenwood. Brunnian links. Fundamenta Mathematicae, Tome 193 (2007) pp. 259-276. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-fm193-3-3/