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

DOI10.1134/S0081543815010095zbMATH Open1336.52024arXiv1410.0744OpenAlexW2964185763MaRDI QIDQ492212FDOQ492212

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)

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.

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

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

zbMATH Keywords

sphere packingTammes problemkissing numberscontact graphs

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)

Cites Work

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

Cited In (8)

• Deriving finite sphere packings
• The optimal packing of eight points in the real projective plane
• Towards a proof of the 24-cell conjecture
• Special metric invariants
• Enumeration of irreducible contact graphs on the sphere
• Contact graphs of ball packings
• Graphs and spherical two-distance sets
• Title not available (Why is that?)

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)