0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Algebra

Buy Now

Lecture Notes On Knot Invariants (Hardcover) Loot Price: R1,867
Discovery Miles 18 670
Lecture Notes On Knot Invariants (Hardcover): Weiping Li

Lecture Notes On Knot Invariants (Hardcover)

Weiping Li

 (sign in to rate)
Loot Price R1,867 Discovery Miles 18 670 | Repayment Terms: R175 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

The volume is focused on the basic calculation skills of various knot invariants defined from topology and geometry. It presents the detailed Hecke algebra and braid representation to illustrate the original Jones polynomial (rather than the algebraic formal definition many other books and research articles use) and provides self-contained proofs of the Tait conjecture (one of the big achievements from the Jones invariant). It also presents explicit computations to the Casson-Lin invariant via braid representations.With the approach of an explicit computational point of view on knot invariants, this user-friendly volume will benefit readers to easily understand low-dimensional topology from examples and computations, rather than only knowing terminologies and theorems.

General

Imprint: World Scientific Publishing Co Pte Ltd
Country of origin: Singapore
Release date: October 2015
First published: 2016
Authors: Weiping Li
Dimensions: 231 x 155 x 18mm (L x W x T)
Format: Hardcover
Pages: 244
ISBN-13: 978-981-4675-95-6
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Science & Mathematics > Mathematics > Algebra > General
Books > Science & Mathematics > Mathematics > Topology > Algebraic topology
Promotions
LSN: 981-4675-95-4
Barcode: 9789814675956

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners