Extremal problems of circle packings on a sphere and irreducible contact graphs

DOI10.1134/S0081543815010095MaRDI QIDQ492212zbMATH OpenOpenAlexFDO

Authors Oleg R. Musin, Alexey S. Tarasov

Publication date 20 August 2015

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

contact graphskissing numberssphere packingTammes problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Abstract: Recently, we enumerate up to isometry, all locally rigid circle packings on the unit sphere with number of circles N<12. This problem is equivalent to the enumeration of irreducible contact graphs. In this paper we show that by using the list of irreducible graphs can solve various problems of extreme packings such as the Tammes problem for the sphere and the projective plane, the maximal contacts problem, Danzer's and other problems on irreducible contact graphs.

Review text

A sphere packing in space is called locally rigid if the spheres are arranged so that each sphere from the packing is fixed between its neighbors and cannot be moved aside in a way that increases the minimum distance between the center of this sphere and the centers of other spheres. Let \(S_1, \ldots, S_N\) be disjoint spheres of the same radius \(r\) in \({\mathbb R}^3\), arranged so that all of them touch one (central) sphere of unit radius. Let \(P=\{A_1, \ldots, A_N\}\) be the set of tangency points between the central sphere and \(S_1, \ldots, S_N\). The points \(A_i\) and \(A_j\) are connected by an edge (the minimal arc of the great circle) if \(S_i\) and \(S_j\) touch each other. The graph obtained in this way is called a contact graph. If the associated packing on the sphere \({\mathbb S}^2\) is locally rigid, then the graph is called irreducible. The authors [J. Math. Sci., New York 203, No. 6, 837--850 (2014; Zbl 1310.52024); translation from Fundam. Prikl. Mat. 18, No. 2, 125--145 (2013)] have recently enumerated (up to isometry) all locally rigid packings of congruent circles (spherical caps) on the unit sphere with the number of circles \(N\leq 11\). This problem is equivalent to the enumeration of irreducible spherical contact graphs. In the paper under review, the authors show that using the list of irreducible contact graphs, one can solve various problems on extremal packings, such as Tammes problem for the sphere and projective plane, the problem of the maximum kissing number in spherical packings, Danzer's problems and other selected problems on irreducible contact graphs.

Recommendations

• Enumeration of irreducible contact graphs on the sphere
• scientific article; zbMATH DE number 4046538
• scientific article; zbMATH DE number 3851111
• Note on packings in Grassmannian space G(3,1)
• Packing of 180 equal circles on a sphere

Cites work

• A survey on the kissing numbers.
• Arrangement of 24 points on a sphere
• Arrangements of 14, 15, 16 and 17 points on a sphere
• Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
• Das Problem der dreizehn Kugeln
• Deriving finite sphere packings
• Distribution of points in the elliptic plane
• Enumeration of irreducible contact graphs on the sphere
• Fast generation of some classes of planar graphs
• Finite point-sets on S 2 with minimum distance as large as possible
• scientific article; zbMATH DE number 3915121 (Why is no real title available?)
• scientific article; zbMATH DE number 1188564 (Why is no real title available?)
• scientific article; zbMATH DE number 2068101 (Why is no real title available?)
• scientific article; zbMATH DE number 2068102 (Why is no real title available?)
• scientific article; zbMATH DE number 1785741 (Why is no real title available?)
• scientific article; zbMATH DE number 3083197 (Why is no real title available?)
• Lagerung von Punkten auf der Kugel
• Least action principle of crystal formation of dense packing type and Kepler's conjecture
• Optimal packings of congruent circles on a square flat torus
• Packing twelve spherical caps to maximize tangencies
• Punkte auf der Kugel. Drei Zusätze
• Research Problems in Discrete Geometry
• The kissing number in four dimensions
• The kissing problem in three dimensions
• The one-sided kissing number in four dimension
• The Problem of the Thirteen Spheres
• The problem of the twenty-five spheres
• The problem of thirteen spheres -- a proof for undergraduates
• The strong thirteen spheres problem
• The Tammes problem for N = 14
• The thirteen spheres: a new proof
• Three-point bounds for energy minimization
• Über eine Abschätzung des kürzesten Abstandes zweier Punkte eines auf einer Kugelfläche liegenden Punktsystems

Cited in

(9)

• Note on packings in Grassmannian space G(3,1)
• Special metric invariants
• Contact graphs of ball packings
• Enumeration of irreducible contact graphs on the sphere
• Graphs and spherical two-distance sets
• Deriving finite sphere packings
• scientific article; zbMATH DE number 3851111 (Why is no real title available?)
• The optimal packing of eight points in the real projective plane
• Towards a proof of the 24-cell conjecture

Describes a project that uses

Uses Software

• plantri

This page was built for publication: Extremal problems of circle packings on a sphere and irreducible contact graphs

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