Skip to main content

On Soddy’s Hexlet and a Linked 4-Pair

  • Conference paper
Book cover Discrete and Computational Geometry (JCDCG 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1763))

Included in the following conference series:

Abstract

An n-cycle of balls is a cyclic sequence of non-overlapping n balls in R 3 in which each consecutive pair of balls are tangent. An (m,n)-link is a pair of an m-cycle and an n-cycle that form a non-splittable link, with no two balls overlapping. It is proved that (1) a (3,n)-link exists only when n ≥ 6, and in any (3,6)-link, each ball in the 3-cycle is tangent to all balls in the 6-cycle, (2) a (4,4)-cycle exists and in any (4,4)-cycle, each ball in a 4-cycle is tangent to all balls in the other 4-cycle.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, C.C.: The Knot Book. Freeman, New York (1994)

    MATH  Google Scholar 

  2. Maehara, H., Oshiro, A.: On knotted necklaces of pearls. European J. Combinatorics 20, 411–420 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Maehara, H., Oshiro, A.: Arranging solid balls to represent a graph I (submitted)

    Google Scholar 

  4. Stanley Ogilvy, C.: Excursions in Geometry. Dover Publications, Inc., New York (1990)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maehara, H., Oshiro, A. (2000). On Soddy’s Hexlet and a Linked 4-Pair. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 1998. Lecture Notes in Computer Science, vol 1763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46515-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46515-7_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67181-7

  • Online ISBN: 978-3-540-46515-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics