Skip Navigation



Journal of Topology Advance Access published online on May 9, 2008

Journal of Topology, doi:10.1112/jtopol/jtn011
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
1/3/557    most recent
jtn011v1
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Boileau, M.
Right arrow Articles by Paoluzzi, L.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 London Mathematical Society

On cyclic branched coverings of prime knots

Michel Boileau

Université Paul Sabatier, Laboratoire Emile Picard (UMR 5580 du CNRS), 118 route de Narbonne, 31062 Toulouse cedex 4 France boileau@picard.ups-tlse.fr

Luisa Paoluzzi

Université de Bourgogne, I.M.B. (UMR 5584 du CNRS), B.P. 47 870, 9 av. Alain Savary, 21078 Dijon cedex France paoluzzi@u-bourgogne.fr


   Abstract

We prove that a prime knot K is not determined by its p-fold cyclic branched cover for at most two odd primes p. Moreover, we show that for a given odd prime p, the p-fold cyclic branched cover of a prime knot K is the p-fold cyclic branched cover of at most one more knot K' non-equivalent to K. To prove the main theorem, a result concerning symmetries of knots is also obtained. This latter result can be interpreted as a characterisation of the trivial knot.

Received February 26, 2007.


2000 Mathematics Subject Classification 57M25 (primary), 57M12, 57M50 (secondary)


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.