arXiv Analytics

Sign in

arXiv:0706.3398 [math.GT]AbstractReferencesReviewsResources

The slice-ribbon conjecture for 3-stranded pretzel knots

Joshua Greene, Stanislav Jabuka

Published 2007-06-24, updated 2007-08-07Version 2

We determine the smooth concordance order of the 3-stranded pretzel knots P(p,q,r) with p,q,r odd. We show that each one of finite order is, in fact, ribbon, thereby proving the slice-ribbon conjecture for this family of knots. As corollaries we give new proofs of results first obtained by Fintushel-Stern and Casson-Gordon.

Comments: 21 pages, 5 figures. Significantly expanded version, mistake in previous proof corrected
Categories: math.GT
Subjects: 57M25, 57M27
Related articles: Most relevant | Search more
arXiv:1312.4502 [math.GT] (Published 2013-12-16)
Computing the unknotting numbers of certain pretzel knots
arXiv:1012.2876 [math.GT] (Published 2010-12-13, updated 2012-05-08)
Representation spaces of pretzel knots
arXiv:2011.09943 [math.GT] (Published 2020-11-19)
Pretzel knots up to nine crossings

Links

Toolbox