相关论文: Extreme problems of circle packings on a sphere an…
In this article, using the computer, are enumerated all locally-rigid packings by $N$ congruent circles (spherical caps) on the unit sphere ${\Bbb S}^2 $ with $N < 12.$ This is equivalent to the enumeration of irreducible spherical contact…
The Tammes problem is to find the arrangement of N points on a unit sphere which maximizes the minimum distance between any two points. This problem is presently solved for several values of N, namely for N=3,4,6,12 by L. Fejes Toth (1943);…
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of "super…
Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for…
Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…
Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary…
The thirteen spheres problem is asking if 13 equal size nonoverlapping spheres in three dimensions can touch another sphere of the same size. This problem was the subject of the famous discussion between Isaac Newton and David Gregory in…
In discrete geometry, the contact number of a given finite number of non-overlapping spheres was introduced as a generalization of Newton's kissing number. This notion has not only led to interesting mathematics, but has also found…
A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more…
Circle packings are arrangement of circles satisfying specified tangency requirements. Many problems about packing of circles and spheres occur in nature particularly in material design and protein structure. Surprisingly, little is known…
The core of this note is the observation that links between circle packings of graphs and potential theory developed in \cite{BeSc01} and \cite{HS} can be extended to higher dimensions. In particular, it is shown that every limit of finite…
The contact graph of a packing of translates of a convex body in Euclidean $d$-space $\mathbb E^d$ is the simple graph whose vertices are the members of the packing, and whose two vertices are connected by an edge if the two members touch…
A family of spherical caps of the 2-dimensional unit sphere $\mathbb{S}^2$ is called a totally separable packing in short, a TS-packing if any two spherical caps can be separated by a great circle which is disjoint from the interior of each…
Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for…
Various packing problems and simulations of hard and soft interacting particles, such as microscopic models of nematic liquid crystals, reduce to calculations of intersections and pair interactions between ellipsoids. When constrained to a…
We have studied the packing of congruent disks on a spherical cap, for caps of different size and number of disks, $N$. This problem has been considered before only in the limit cases of circle packing inside a circle and on a sphere…
The Tammes problem delves into the optimal arrangement of $N$ points on the surface of the $n$-dimensional unit sphere (denoted as $\mathbb{S}^{n-1}$), aiming to maximize the minimum distance between any two points. In this paper, we…
We algorithmically characterize the maximal contact number problem for finite congruent lattice sphere packings in $\mathbb{R}^d$ and show that in $\mathbb{R}^3$ this problem is equivalent to determining the maximal coordination of a…
This paper encompasses the mathematical derivations of the analytic and generalized formula and recurrence relations to find out the radii of n umber of circles inscribed or packed in the plane region bounded by circular arcs (including…
We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper…