Diagram Genus, Generators, and Applications
Home > Mathematics and Science Textbooks > Mathematics > Geometry > Diagram Genus, Generators, and Applications: (Chapman & Hall/CRC Monographs and Research Notes in Mathematics)
Diagram Genus, Generators, and Applications: (Chapman & Hall/CRC Monographs and Research Notes in Mathematics)

Diagram Genus, Generators, and Applications: (Chapman & Hall/CRC Monographs and Research Notes in Mathematics)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

In knot theory, diagrams of a given canonical genus can be described by means of a finite number of patterns ("generators"). Diagram Genus, Generators and Applications presents a self-contained account of the canonical genus: the genus of knot diagrams. The author explores recent research on the combinatorial theory of knots and supplies proofs for a number of theorems. The book begins with an introduction to the origin of knot tables and the background details, including diagrams, surfaces, and invariants. It then derives a new description of generators using Hirasawa’s algorithm and extends this description to push the compilation of knot generators one genus further to complete their classification for genus 4. Subsequent chapters cover applications of the genus 4 classification, including the braid index, polynomial invariants, hyperbolic volume, and Vassiliev invariants. The final chapter presents further research related to generators, which helps readers see applications of generators in a broader context.

Table of Contents:
Introduction The beginning of knot theory Reidemeister moves and invariants Combinatorial knot theory Genera of knots Overview of results Issues of presentation Further applications Preliminaries Knots and diagrams Crossing number and writhe Knotation and not-tables Seifert surfaces and genera Graphs Diagrammatic moves Braids and braid representations Link polynomials MWF inequality, Seifert graph, and graph index The signature Genus generators Knots vs. links The maximal number of generator crossings and ~-equivalence classes Generator crossing number inequalities An algorithm for special diagrams Proof of the inequalities Applications and improvements Generators of genus 4 Unknot diagrams, non-trivial polynomials, and achiral knots Some preparations and special cases Reduction of unknot diagrams Simplifications Examples Non-triviality of skein and Jones polynomial On the number of unknotting Reidemeister moves Achiral knot classification The signature Braid index of alternating knots Motivation and history Hidden Seifert circle problem Modifying the index Simplified regularization A conjecture Minimal string Bennequin surfaces Statement of result The restricted index Finding a minimal string Bennequin surface The Alexander polynomial of alternating knots Hoste’s conjecture The log-concavity conjecture Complete linear relations by degree Outlook Legendrian invariants and braid index Minimal genus and fibering of canonical surfaces Wicks forms, markings, and enumeration of alternating knots by genus Crossing numbers Canonical genus bounds hyperbolic volume The relation between volume and the slN polynomial Everywhere equivalent links

About the Author :
Alexander Stoimenow is an assistant professor in the GIST College at the Gwangju Institute of Science and Technology. He was previously an assistant professor in the Department of Mathematics at Keimyung University, Daegu, South Korea. His research covers several areas of knot theory, with relations to combinatorics, number theory, and algebra. He earned a PhD from the Free University of Berlin.

Review :
"Diagram Genus, Generators and Applications contains a systematical study of combinatorial properties of knot diagrams. It focuses on diagrams that represent the canonical genus of a knot, i.e., the minimal genus of all Seifert surfaces for a given knot that are obtained by applying Seifert’s algorithm to diagrams of the knot. The book contains the complete classification of knots up to canonical genus 4. This classification has lots of applications … The book … will certainly become a reference in this area. It is very clearly written and contains enough background material so that it can be used by graduate-level students to learn the subject and do work in this area on their own." —Thomas Fiedler, Institut de Mathématiques, Université Paul Sabatier, Toulouse "This book provides an essential resource for anyone currently doing research or interested in doing research on surfaces in knot complements and their applications. Enough background is included so non-experts can follow the exposition and appreciate the myriad results that ensue." —Professor Colin Adams, Williams College "This monograph is a systematic account of combinatorial knot theory, with a particular focus on spanning surfaces arising from Seifert’s construction. It includes a brief and nicely written introduction to knot theory, concentrating on the background needed for a diagrammatic treatment of knots, including the range of classical and modern knot polynomials. A strong feature of this book, and indeed much of the author’s work elsewhere, is the identification of diagrammatic examples with awkward or unexpected properties, and an analysis of the techniques that can be used effectively on them. This can provide examples that can’t possibly be tackled by certain procedures, and thus directs attention to places where the current repertoire of techniques is lacking. The main topic developed is the notion of diagram genus, or canonical genus, based on Seifert’s algorithm. The related graph theory leads to the selection of a class of alternating knot diagrams, termed generators, and a substantial account of these up to genus 4 is given. This is followed by the discussion of a number of combinatorial results and conjectures. In particular, some nice results for alternating or positive knots are given and their possible extension to the case when k of the knot crossings are switched is explored for small values of k. The earlier calculations are used to extend the knowledge of these results to cover knots with fewer restrictions on their genus or crossing number. There is a good account of the combinatorics for recognizing when a knot diagram actually represents the trivial knot. It is surprisingly easy to draw diagrams of the trivial knot with relatively few crossings that do not have an immediately obvious simplification, and some examples are included in the illustrations. A further section covers the question of finding the braid index for an alternating knot, and the conditions under which the Morton-Franks-Williams bound turn out to be sharp. The concluding section is intended as an appetizer for others and includes a variety of annotated questions and conjectures. The carefully written text is aimed at a graduate-level readership. It gives a comprehensive view of combinatorial questions, both in the monograph itself and in the well-annotated bibliography, and would serve both well as a reference and a source of new ideas. Features A comprehensive account of diagram-centered results in knot theory Focus on Seifert’s construction of oriented-spanning surfaces Analysis of diagrams representing the unknot and their reduction by Reidemeister moves Careful and persuasive writing An excellent reference text and source of ideas" —H.R. Morton, Department of Mathematical Sciences, University of Liverpool


Best Sellers


Product Details
  • ISBN-13: 9781498733823
  • Publisher: Taylor & Francis Inc
  • Publisher Imprint: Chapman & Hall/CRC
  • Language: English
  • No of Pages: 174
  • ISBN-10: 1498733824
  • Publisher Date: 22 Feb 2016
  • Binding: Digital (delivered electronically)
  • No of Pages: 174
  • Series Title: Chapman & Hall/CRC Monographs and Research Notes in Mathematics


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Diagram Genus, Generators, and Applications: (Chapman & Hall/CRC Monographs and Research Notes in Mathematics)
Taylor & Francis Inc -
Diagram Genus, Generators, and Applications: (Chapman & Hall/CRC Monographs and Research Notes in Mathematics)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Diagram Genus, Generators, and Applications: (Chapman & Hall/CRC Monographs and Research Notes in Mathematics)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!