No label defined (Q3782344)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4044617
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4044617 |
Statements
1987
0 references
circle packings
0 references
covering of the Euclidean plane
0 references
densest lattice packing
0 references
decomposing a covering into two packings
0 references
0.9310526251792908
0 references
0.9144109487533568
0 references
0.8718769550323486
0 references
0.8703014850616455
0 references
0.8663104176521301
0 references
\({\mathfrak P}(r)\) signifies a packing in the Euclidean plane of circles (closed circular discs) of radius r, that is each point of the plane is in the interior of at most one circle from \({\mathfrak P}(r)\); \({\mathfrak U}(r_ 1,r_ 2)\) signifies a covering of the plane by a countable set of circles each of radius \(r_ 1\) or \(r_ 2\), that is each point of the plane is in at least one circle from \({\mathfrak U}(r_ 1,r_ 2)\). This paper addresses the problem: are there two packings \({\mathfrak P}(r_ 1)\) and \({\mathfrak Q}(r_ 2)\) which form a covering \({\mathfrak U}(r_ 1,r_ 2) ?\) With no loss of generality, assume \(0<r_ 1=r\leq r_ 2=1.\) The author proves that, for each \({\mathfrak P}(1)\) there is one packing \({\mathfrak Q}(r),0<r<1\), which with \({\mathfrak P}(1)\) covers the plane precisely when \({\mathcal P}(1)\) is a densest lattice packing; in this case \(r=1/\sqrt{3}.\) There is a corresponding result about decomposing a covering into two packings.
0 references