0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Geometry > Algebraic geometry

Buy Now

One-cocycles And Knot Invariants (Hardcover) Loot Price: R3,230
Discovery Miles 32 300
One-cocycles And Knot Invariants (Hardcover): Thomas Fiedler

One-cocycles And Knot Invariants (Hardcover)

Thomas Fiedler

Series: Series on Knots & Everything, 73

 (sign in to rate)
Loot Price R3,230 Discovery Miles 32 300 | Repayment Terms: R303 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

One-Cocycles and Knot Invariants is about classical knots, i.e., smooth oriented knots in 3-space. It introduces discrete combinatorial analysis in knot theory in order to solve a global tetrahedron equation. This new technique is then used to construct combinatorial 1-cocycles in a certain moduli space of knot diagrams. The construction of the moduli space makes use of the meridian and the longitude of the knot. The combinatorial 1-cocycles are therefore lifts of the well-known Conway polynomial of knots, and they can be calculated in polynomial time. The 1-cocycles can distinguish loops consisting of knot diagrams in the moduli space up to homology. They give knot invariants when they are evaluated on canonical loops in the connected components of the moduli space. They are a first candidate for numerical knot invariants which can perhaps distinguish the orientation of knots.

General

Imprint: World Scientific Publishing Co Pte Ltd
Country of origin: Singapore
Series: Series on Knots & Everything, 73
Release date: 2023
Authors: Thomas Fiedler
Format: Hardcover
Pages: 340
ISBN-13: 978-981-12-6299-9
Categories: Books > Science & Mathematics > Mathematics > Geometry > Algebraic geometry
LSN: 981-12-6299-3
Barcode: 9789811262999

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