Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Tait conjecture in g(S^1xS^2) (1602.03092v1)

Published 9 Feb 2016 in math.GT

Abstract: The Tait conjecture states that alternating reduced diagrams of links in S3 have the minimal number of crossings. It has been proved in 1987 by M. Thistlethwaite, L. Kauffman and K. Murasugi studying the Jones polynomial. The author proved an analogous result for alternating links in S1xS2 giving a complete answer to this problem. In this paper we extend the result to alternating links in the connected sum #_g(S1xS2) of g copies of S1xS2. In S1xS2 and #_2(S1xS2) the appropriate version of the statement is true for \Z_2-homologically trivial links, and the proof also uses the Jones polynomial. Unfortunately in the general case the method provides just a partial result and we are not able to say if the appropriate statement is true.

Summary

We haven't generated a summary for this paper yet.