Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/14262
Title: Some Fibred Knots with Bi-orderable Knot Groups
Authors: Lu, Wangshan
Advisor: Nicas, Andrew
Department: Mathematics and Statistics
Keywords: knots;orderability of knot groups;Alexander polynomial;special polynomial;Linnell;Rhemtulla;Rolfsen;Mathematics;Physical Sciences and Mathematics;Statistics and Probability;Mathematics
Publication Date: 2007
Abstract: <p>This project aims to give an overview of knots, orderability of knot groups, and to construct knots for which the knot groups enjoy some nice properties.</p> <p>To accomplish this, we first present some preliminary results concerning knots and knot groups. We then introduce the Alexander polynomial, and explain the idea of a special polynomial originally introduced by Linnell, Rhemtulla and Rolfsen. By investigating the conditions on a special polynomial, we classify all the special Alexander polynomial of fibred knots of degree less than 10. Finally we construct examples of fibred knots which have a special Alexander polynomial.</p>
URI: http://hdl.handle.net/11375/14262
Identifier: opendissertations/9083
10164
5686369
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File SizeFormat 
fulltext.pdf
Open Access
828.99 kBAdobe PDFView/Open
Show full item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue