Ball packings for links

DOI10.1016/J.EJC.2021.103351zbMATH Open1469.52015arXiv2010.00580OpenAlexW3163141445MaRDI QIDQ2033894FDOQ2033894

Authors: Iván Rasskin, Jorge Luis Ramírez Alfonsín 

Publication date: 18 June 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: The ball number of a link $L$, denoted by $ball(L)$, is the minimum number of solid balls (not necessarily of the same size) needed to realize a necklace representing $L$. In this paper, we show that $ball(L)leq5cr(L)$ where $cr(L)$ denotes the crossing number of $L$. To this end, we use Lorentz geometry applied to ball packings. The well-known Koebe-Andreev-Thurston circle packing Theorem is also an important brick for the proof. Our approach yields to an algorithm to construct explicitly the desired necklace representation of $L$ in the 3-dimensional space.

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

Recommendations

• Publication:4946612
• Pearl numbers versus stick numbers for knots
• Arranging solid balls to represent a graph
• scientific article; zbMATH DE number 1877241
• UPPER BOUNDS ON LINKING NUMBERS OF THICK LINKS

zbMATH Keywords

linkscrossing numbernecklacesfinite balls packings

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Real and complex geometry (51M99) Knot theory (57K10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Average kissing numbers for non-congruent sphere packings
• Lorentzian Coxeter systems and Boyd-Maxwell ball packings
• Beyond the Descartes Circle Theorem
• Title not available (Why is that?)
• A new class of infinite sphere packings
• A generalization of Apollonian packing of circles
• Title not available (Why is that?)
• A circle packing algorithm
• Contact graphs of unit sphere packings revisited
• On configurations of solid balls in 3-space: chromatic numbers and knotted cycles
• On knotted necklaces of pearls
• Combinatorics encoding geometry: the legacy of Bill Thurston in the story of one theorem
• On stick number of knots and links
• Title not available (Why is that?)
• Inversive geometry and the hexlet
• Title not available (Why is that?)

Cited In (7)

• The two-eyes lemma: a linking problem for table-top necklaces
• Title not available (Why is that?)
• Links in orthoplicial Apollonian packings
• Regular polytopes, sphere packings and Apollonian sections
• Edge close ball packings
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• CirclePack

This page was built for publication: Ball packings for links

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