top
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.
Paul Gartside, and Sina Greenwood. "Brunnian links." Fundamenta Mathematicae 193.3 (2007): 259-276. <http://eudml.org/doc/282667>.
@article{PaulGartside2007, abstract = {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.}, author = {Paul Gartside, Sina Greenwood}, journal = {Fundamenta Mathematicae}, keywords = {link; Brunnian link; Borromean rings; braid}, language = {eng}, number = {3}, pages = {259-276}, title = {Brunnian links}, url = {http://eudml.org/doc/282667}, volume = {193}, year = {2007}, }
TY - JOUR AU - Paul Gartside AU - Sina Greenwood TI - Brunnian links JO - Fundamenta Mathematicae PY - 2007 VL - 193 IS - 3 SP - 259 EP - 276 AB - 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. LA - eng KW - link; Brunnian link; Borromean rings; braid UR - http://eudml.org/doc/282667 ER -