Extremal problems of circle packings on a sphere and irreducible contact graphs (Q492212): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(8 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Oleg R. Musin / rank | |||
Property / author | |||
Property / author: Alexey S. Tarasov / rank | |||
Property / 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. | |||
Property / 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52C17 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6473902 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
sphere packing | |||
Property / zbMATH Keywords: sphere packing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
kissing numbers | |||
Property / zbMATH Keywords: kissing numbers / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Tammes problem | |||
Property / zbMATH Keywords: Tammes problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
contact graphs | |||
Property / zbMATH Keywords: contact graphs / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Oleg R. Musin / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Alexey S. Tarasov / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Iskander M. Aliev / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: plantri / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1410.0744 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3840854 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The thirteen spheres: a new proof / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deriving Finite Sphere Packings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3692394 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4464712 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4464713 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arrangements of 14, 15, 16 and 17 points on a sphere / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey on the kissing numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Research Problems in Discrete Geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2741325 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three-point bounds for energy minimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite point-sets on S 2 with minimum distance as large as possible / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über eine Abschätzung des kürzesten Abstandes zweier Punkte eines auf einer Kugelfläche liegenden Punktsystems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5824053 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distribution of points in the elliptic plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing twelve spherical caps to maximize tangencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lagerung von Punkten auf der Kugel / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2782044 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Problem of the Thirteen Spheres / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4547111 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The problem of thirteen spheres -- a proof for undergraduates / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The problem of the twenty-five spheres / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The kissing problem in three dimensions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The one-sided kissing number in four dimension / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The kissing number in four dimensions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal packings of congruent circles on a square flat torus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The strong thirteen spheres problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumeration of irreducible contact graphs on the sphere / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Tammes Problem for <i>N</i> = 14 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arrangement of 24 points on a sphere / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Das Problem der dreizehn Kugeln / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Punkte auf der Kugel. Drei Zusätze / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2964185763 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Extremal problems of circle packings on a sphere and irreducible contact graphs |
scientific article |
Statements
Extremal problems of circle packings on a sphere and irreducible contact graphs (English)
0 references
20 August 2015
0 references
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.
0 references
sphere packing
0 references
kissing numbers
0 references
Tammes problem
0 references
contact graphs
0 references
0 references