Vol. 197, No. 1, 2001

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 332: 1  2
Vol. 331: 1  2
Vol. 330: 1  2
Vol. 329: 1  2
Vol. 328: 1  2
Vol. 327: 1  2
Vol. 326: 1  2
Vol. 325: 1  2
Online Archive
Volume:
Issue:
     
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Officers
 
Subscriptions
 
ISSN 1945-5844 (electronic)
ISSN 0030-8730 (print)
 
Special Issues
Author index
To appear
 
Other MSP journals
A generalized Burau representation for string links

Daniel S. Silver and Susan G. Williams

Vol. 197 (2001), No. 1, 241–255
Abstract

A 2-variable matrix ℬ∈ GLn(Z[u±1,v±1]) is defined for any n-string link, generalizing the Burau matrix of an n-braid. The specialization u = 1,v = t1 recovers the generalized Burau matrix recently defined by X. S. Lin, F. Tian and Z. Wang using probabilistic methods. The specialization u = t1,v = 1 results in a matrix with a natural algebraic interpretation, and one that yields homological information about the complement of the closed string link.

Milestones
Received: 3 January 1999
Revised: 28 February 1999
Published: 1 January 2001
Authors
Daniel S. Silver
Department of Mathematics and Statistics
University of South Alabama
Mobile, AL 36688
Susan G. Williams
University of South Alabama
Mobile, AL 36688