An Index Of A Graph With Applications To Knot Theory


Download An Index Of A Graph With Applications To Knot Theory PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get An Index Of A Graph With Applications To Knot Theory book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.

Download

An Index of a Graph with Applications to Knot Theory


An Index of a Graph with Applications to Knot Theory

Author: Kunio Murasugi

language: en

Publisher: American Mathematical Soc.

Release Date: 1993


DOWNLOAD





There are three chapters to the memoir. The first defines and develops the notion of the index of a graph. The next chapter presents the general application of the graph index to knot theory. The last section is devoted to particular examples, such as determining the braid index of alternating pretzel links. A second result shows that for an alternating knot with Alexander polynomial having leading coefficient less than 4 in absolute value, the braid index is determined by polynomial invariants.

An index of a graph with applications to knot theory


An index of a graph with applications to knot theory

Author: Kunio Murasugi

language: it

Publisher:

Release Date: 1993


DOWNLOAD





Index of a Graph with Applications to Knot Theory


Index of a Graph with Applications to Knot Theory

Author: Kunio Murasugi

language: en

Publisher: Oxford University Press, USA

Release Date: 2014-08-31


DOWNLOAD





This book presents a remarkable application of graph theory to knot theory. In knot theory, there are a number of easily defined geometric invariants that are extremely difficult to compute; the braid index of a knot or link is one example. The authors evaluate the braid index for many knots and links using the generalized Jones polynomial and the index of a graph, a new invariant introduced here. This invariant, which is determined algorithmically, is likely to be of particular interest to computer scientists.