2000 character limit reached
Conway polynomials of two-bridge links
Published 27 Nov 2010 in math.GT | (1011.5992v2)
Abstract: We give necessary conditions for a polynomial to be the Conway polynomial of a two-bridge link. As a consequence, we obtain simple proofs of the classical theorems of Murasugi and Hartley. We give a modulo 2 congruence for links, which implies the classical modulo 2 Murasugi congruence for knots. We also give sharp bounds for the coefficients of the Conway and Alexander polynomials of a two-bridge link. These bounds improve and generalize those of Nakanishi and Suketa.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.