Penny graphs in the hyperbolic plane
\'Ad\'am Sagmeister, Konrad J. Swanepoel

TL;DR
This paper investigates the maximum number of touching pairs in packings of congruent circles in the hyperbolic plane, providing bounds and conjectures on extremal configurations related to hyperbolic tilings.
Contribution
It introduces new bounds for touching pairs in hyperbolic circle packings and conjectures the extremal configuration based on hyperbolic tilings.
Findings
Upper bounds for touching pairs depending on circle diameter.
Lower bounds showing linear growth in the number of touching pairs.
Identification of specific diameter ranges where certain configurations are optimal.
Abstract
We consider the problem of finding the maximum number of pairs of touching circles in a packing of congruent circles of diameter in the hyperbolic plane of curvature . In the Euclidean plane, the maximum comes from a spiral construction of the tiling of the plane with equilateral triangles (Harborth 1974), with a similar result in the hyperbolic plane for the values of corresponding to the order- triangular tilings (Bowen 2000). We present various upper and lower bounds for for all values of . In particular, we prove that if except for , then the number of touching pairs is less than the one coming from a spiral construction in the order- triangular tiling, which we conjecture to be extremal. We also give a lower bound where for all .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Point processes and geometric inequalities · Computational Geometry and Mesh Generation
