Related papers: Regular Totally Separable Sphere Packings
The classical honeycomb conjecture asserts that any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal honeycomb tiling. Pappus discusses this problem in his preface to Book V. This paper…
We find explicit subdivision rules for all special cubulated groups. A subdivision rule for a group produces a sequence of tilings on a sphere which encode all quasi-isometric information for a group. We show how these tilings detect…
Cellular solids are a class of materials that have many interesting engineering applications, including ultralight structural materials. The traditional method for analyzing these solids uses convex uniform polyhedral honeycombs to…
The densest local packings of N three-dimensional identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained for selected values of N up to N = 1054. In the predecessor to this paper…
We study edge-to-edge tilings of the sphere by edge congruent pentagons, under the assumption that there are tiles with all vertices having degree 3. We develop the technique of neighborhood tilings and apply the technique to completely…
This paper provides triangular spherical designs for the complex unit sphere $\Omega^d$ by exploiting the natural correspondence between the complex unit sphere in $d$ dimensions and the real unit sphere in $2d-1$. The existence of…
Given topological spaces X and Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X -> Y . We consider a computational version, where X, Y are given as finite simplicial complexes, and the…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
In this paper, we give a full classification of the separable hypersurfaces of constant sectional curvature in the Euclidean $n$-space $\mathbb{R}^n$. In dimension $n=3$, this classification was solved by Hasanis and L\'opez [Manuscripta…
We develop a systematic method for computing the angle combinations at all vertices in an edge-to-edge tiling of the sphere by pentagons with the same five angles. The method is a useful and necessary step in many tiling problems about…
We classify the dihedral edge-to-edge tilings of the sphere by squares and rhombi.
Dense polyhedron packings are useful models of a variety of condensed matter and biological systems and have intrigued scientists mathematicians for centuries. Recently, organizing principles for the types of structures associated with the…
This paper develops an explicit and implementable framework for constructing spherical designs by lifting point sets from tight fusion frames. By combining existing ingredients, we obtain, in every dimension, explicit spherical $5$-designs…
In this paper, on envelopes created by sphere families in Euclidean 3-space, all four basic problems (existence problem, representation problem, problem on the number of envelopes, problem on relationships of definitions) are solved.
In earlier works \cite{Sz06-1}, \cite{Sz06-2}, \cite{Sz13-3} and \cite{Sz13-4} we have investigated the densest packings and the least dense coverings by congruent hyperballs (hyperspheres) to the regular prism tilings in $n$-dimensional…
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 classify the total spaces of bundles over the four sphere with fiber a three sphere up to orientation preserving and reversing homotopy equivalence, homeomorphism and diffeomorphism. These total spaces have been of interest to both…
A problem posed by Erd\H{o}s in 1945 initiated the study of non-separable arrangements of convex bodies. A finite collection of convex bodies in Euclidean $d$-space is called a non-separable family (or NS-family) if every hyperplane…
In a convex mosaic in $\mathbb{R} ^d$ we denote the average number of vertices of a cell by $\bar v$ and the average number of cells meeting at a node by $\bar n$. Except for the $d=2$ planar case, there is no known formula prohibiting…
A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…