The two-eyes lemma: a linking problem for table-top necklaces

DOI10.1007/S00373-021-02439-XMaRDI QIDQ2115141zbMATH OpenOpenAlexWikidataFDO

Authors David Gabai, Robert Meyerhoff, A. Yarmola

Publication date 15 March 2022

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.02119

zbMATH Keywords

horoballpackingsphereshyperbolic 3-manifold

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Hyperbolic 3-manifolds (57K32)

Abstract: In the course of our work on low-volume hyperbolic 3-manifolds, we came upon a linking problem for horoball necklaces in $mathbb{H}^3$. A horoball necklace is a collection of sequentially tangent beards (i.e. spheres) with disjoint interiors lying on a flat table (i.e. a plane) such that each bead is of diameter at most one and is tangent to the table. In this note, we analyze the possible configurations of an 8-bead necklace linking around two other diameter-one spheres on the table. We show that all the beads are forced to have diameter one, the two linked spheres are tangent, and that each bead must kiss (i.e. be tangent to) at least one of the two linked spheres. In fact, there is a 1-parameter family of distinct configurations.

Recommendations

• Publication:4946612
• On knotted necklaces of pearls
• Ball packings for links
• Publication:4504024
• CYLINDRICAL HIERARCHY FOR DEFORMING NECKLACES

Cites work

• scientific article; zbMATH DE number 1014124 (Why is no real title available?)
• Ball packings for links
• Configuration spaces of equal spheres touching a given sphere: the twelve spheres problem
• Das Problem der dreizehn Kugeln
• On configurations of solid balls in 3-space: chromatic numbers and knotted cycles
• On knotted necklaces of pearls

Cited in

(2)

• On the maximum and minimum areas of the necklace
• scientific article; zbMATH DE number 1421751 (Why is no real title available?)

Describes a project that uses

Uses Software

• SnapPy

This page was built for publication: The two-eyes lemma: a linking problem for table-top necklaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115141)