Rehwinkel, Whitehead, Yang, and Yang (2023, published 2024) introduced a class of fractal circle packings built from a "base" circle configuration B and a "dual" configuration B̂ whose tangency graphs are dual cellular decompositions of the plane, generalizing the polyhedral packings of Kontorovich and Nakamura. The construction's validity in full generality rests on their Conjecture 3.3, an infinite analogue of the Koebe–Andreev–Thurston theorem: every pair of simple, 3-connected dual plane graphs realizing a cellular decomposition of the plane and its dual should arise as the tangency graphs of such dual circle configurations, with the pair unique up to similarity. This is known only for triangulations (via discrete uniformization) and for the square grid. Conjecture 3.3 remains open.
Background
A circle packing is a collection of oriented circles in the Riemann sphere with pairwise disjoint interiors, some pairs tangent. Its tangency graph (or nerve) has one vertex per circle and an edge for each tangency; it is automatically a planar graph. A generalized circle is either a round circle or a straight line (a circle through ). The classical Koebe–Andreev–Thurston circle packing theorem (Koebe 1936; Andreev 1970; Thurston 1979) states, in the dual-pair formulation of Brightwell and Scheinerman, that any pair of finite, simple (no loops or parallel edges), 3-connected plane graphs corresponding to a cellular decomposition of the sphere and its dual can be realized simultaneously as the tangency graphs of two collections of circles , with intersections between the two collections orthogonal and occurring at incident vertex–face pairs, and the realization unique up to Möbius transformation (a conformal automorphism of ). A cellular decomposition of a surface is a decomposition into faces by a planar graph whose faces are all topological disks; 3-connected means the graph stays connected after deleting any two vertices. A triangulation is the special case where every face is a triangle.
For infinite graphs the picture is partial. Beardon and Stephenson's uniformization theorem for circle packings, Schramm's existence and rigidity theorems for infinite packings, and Stephenson's Discrete Uniformization Theorem imply that every infinite, simple, 3-connected plane graph representing a triangulation of the plane arises as the tangency graph of a circle configuration unique up to similarity of the plane (a map or with , i.e. a conformal or anti-conformal automorphism of fixing ). For non-triangulating combinatorics much less is known; the main other settled cases are Schramm's theorem on circle patterns with the combinatorics of the square grid, and the triangular lattice, whose uniqueness was proved by Rodin and Sullivan (in an appendix to their circle-packing convergence paper) as a crucial step in their proof.
Rehwinkel, Whitehead, Yang, and Yang used these infinite versions to build a new class of packings. They start from a base configuration and a dual configuration , two collections of oriented generalized circles satisfying: (1) within each collection the circles are pairwise disjoint or tangent, with disjoint interiors; (2) the tangency graphs and are each nontrivial, connected, and dual to each other; (3) a circle of and a circle of either intersect orthogonally and correspond to an incident vertex–face pair of the two graphs, or have disjoint interiors; (4) has at most one accumulation point in . The packing is then the orbit of under the group generated by reflections in the circles of (the Apollonian group of the configuration), a fractal packing that generalizes the polyhedral packings of Kontorovich and Nakamura, which arise from the finite theorem applied to a polyhedron and its dual. The authors' symmetry structure theorems and their arithmetic examples (integrality and superintegrality of curvatures — the curvature of a circle is the reciprocal of its radius, and superintegrality is a stronger arithmetic property arising in the Kontorovich–Nakamura classification of crystallographic packings) presuppose that the underlying base–dual configuration exists and is essentially unique. The finite Koebe–Andreev–Thurston theorem and the triangulation theorem guarantee this for polyhedral packings and for triangulation-based examples, but not for an arbitrary cellular decomposition of the plane. The authors therefore proposed, as their central open problem (Conjecture 3.3), a common infinite extension of the two theorems, noting that when is not a triangulation the configurations and must be constructed together and both are needed for uniqueness.
Problem Statement
Conjecture 3.3 of Rehwinkel–Whitehead–Yang–Yang (the infinite Koebe–Andreev–Thurston theorem for dual pairs). Let and be a pair of simple (no loops or parallel edges), 3-connected plane graphs, corresponding to the 1-skeleton of a cellular decomposition of the plane and the 1-skeleton of its dual cellular decomposition. Do there exist two collections of oriented generalized circles and (the base and dual configurations; a generalized circle is a round circle or a straight line, and orienting it means choosing one of the two sides into which it divides as its interior) such that: (1) the circles within each of and are pairwise disjoint or tangent, with disjoint interiors; (2) the tangency graph of (the graph with one vertex per circle and one edge for each tangency) is isomorphic to and the tangency graph of is isomorphic to , where in each case the isomorphism is of graphs and of the associated cellular decompositions; (3) if a circle of and a circle of intersect, they do so orthogonally and correspond to an incident vertex–face pair of the two decompositions, and otherwise their interiors are disjoint; and (4) has at most one accumulation point in the Riemann sphere ? Moreover, are the configurations and unique up to similarity of the plane, i.e. up to or with ? Condition (3) is one-directional: it forces every intersection of a circle of and a circle of to be orthogonal at an incident vertex–face pair of the two decompositions, but does not require every incident vertex–face pair to intersect. A complete proof that such configurations exist and are unique for every such pair , or an explicit admissible pair for which no such configurations exist or for which two non-similar realization pairs exist, resolves the problem. The problem should not be reduced to the known triangulation or square-grid cases; it concerns arbitrary cellular decompositions of the plane.
References
- Philip Rehwinkel, Ian Whitehead, David Yang, Mengyuan Yang, Circle packings from tilings of the plane, Journal of Geometry 115 (2024), article 17, DOI: 10.1007/s00022-024-00715-8, arXiv:2302.06202, https://arxiv.org/abs/2302.06202
- Kenneth Stephenson, Introduction to Circle Packing: The Theory of Discrete Analytic Functions, Cambridge University Press, Cambridge, 2005, ISBN 0-521-82356-0, zbMATH 1074.52008, https://zbmath.org/2182144
- Alan F. Beardon and Kenneth Stephenson, The uniformization theorem for circle packings, Indiana University Mathematics Journal 39 (1990), 1383–1425, DOI: 10.1512/iumj.1990.39.39062, https://doi.org/10.1512/iumj.1990.39.39062
- Graham R. Brightwell and Edward R. Scheinerman, Representations of planar graphs, SIAM Journal on Discrete Mathematics 6 (1993), 214–229, DOI: 10.1137/0406017, https://doi.org/10.1137/0406017
- Oded Schramm, Existence and uniqueness of packings with specified combinatorics, Israel Journal of Mathematics 73 (1991), 321–341, DOI: 10.1007/BF02773845, https://doi.org/10.1007/BF02773845
- Oded Schramm, Rigidity of infinite (circle) packings, Journal of the American Mathematical Society 4 (1991), 127–149, DOI: 10.1090/S0894-0347-1991-1076089-9, https://doi.org/10.1090/S0894-0347-1991-1076089-9
- Oded Schramm, Circle patterns with the combinatorics of the square grid, Duke Mathematical Journal 86 (1997), 347–389, DOI: 10.1215/S0012-7094-97-08611-7, https://doi.org/10.1215/S0012-7094-97-08611-7
- Burt Rodin and Dennis Sullivan, The convergence of circle packings to the Riemann mapping, Journal of Differential Geometry 26 (1987), 349–360, DOI: 10.4310/jdg/1214441375, https://doi.org/10.4310/jdg/1214441375
- Alex Kontorovich and Kei Nakamura, Geometry and arithmetic of crystallographic sphere packings, Proceedings of the National Academy of Sciences 116 (2019), 436–441, DOI: 10.1073/pnas.1721104116, https://doi.org/10.1073/pnas.1721104116
- Alex Kontorovich and Hee Oh, Apollonian circle packings and closed horospheres on hyperbolic 3-manifolds, Journal of the American Mathematical Society 24 (2011), 603–648, DOI: 10.1090/S0894-0347-2011-00691-7, https://doi.org/10.1090/S0894-0347-2011-00691-7
- Summer Haag, Clyde Kertzer, James Rickards, Katherine Stange, The local-global conjecture for Apollonian circle packings is false, Annals of Mathematics (2) 200 (2024), 749–770, DOI: 10.4007/annals.2024.200.2.6, https://doi.org/10.4007/annals.2024.200.2.6
- Elena Fuchs, Katherine E. Stange, Xin Zhang, Local-global principles in circle packings, Compositio Mathematica 155 (2019), 1118–1170, DOI: 10.1112/s0010437x19007139, https://doi.org/10.1112/s0010437x19007139
- Hanqi Shi, Wenyuan Shi, Ian Whitehead, Ham Williams-Tracy, Jeffrey Zhirui Zhang, The Local-Global Conjecture is False for Generalized Circle Packings, Journal of Number Theory 288 (2026), 103–157, DOI: 10.1016/j.jnt.2026.03.006, arXiv:2510.21702, https://arxiv.org/abs/2510.21702
- Philip L. Bowers and Lorenzo Ruffoni, Infinite circle packings on surfaces with conical singularities, arXiv:2305.03505 (2023), https://arxiv.org/abs/2305.03505
- Yusheng Luo and Yongquan Zhang, Circle packings, renormalizations and subdivision rules, arXiv:2308.13151 (2023), https://arxiv.org/abs/2308.13151
- Yu Sun, Lei Bao, Wenhao Fu, Zunwu He, Existence, Rigidity, and Discrete Schwarz–Pick Lemma for Generalized Hyperbolic Circle Packings with Boundary and Discrete Gaussian Curvatures, arXiv:2608.01195 (2026), https://arxiv.org/abs/2608.01195