Related papers: The Antipode Construction for Sphere Packings
Due to their fast decoding algorithms, quantum generalizations of low-density parity check, or LDPC, codes have been investigated as a solution to the problem of decoherence in fragile quantum states. However, the additional twisted inner…
We study the two-dimensional hierarchical rectangle packing problem, motivated by applications in analog integrated circuit layout, facility layout, and logistics. Unlike classical strip or bin packing, the dimensions of the container are…
The complement of the codimension 2 complex coordinate subspace arrangement is shown to be homotopy equivalent to a wedge of spheres.
The topological structure resulting from the network of contacts between grains (\emph{contact network}) is studied for large samples of monosized spheres with densities (fraction of volume occupied by the spheres) ranging from 0.59 to…
We develop a model to describe the properties of random assemblies of polydisperse hard spheres. We show that the key features to describe the system are (i) the dependence between the free volume of a sphere and the various coordination…
We propose an optimisation method for the inverse structural design of self-assembly of anisotropic patchy particles. The anisotropic interaction can be expressed by the spherical harmonics of the surface pattern on a patchy particle, and…
Creating materials with structure that is independently controllable at a range of scales requires breaking naturally occurring hierarchies. Breaking these hierarchies can be achieved via the decoupling of building block attributes from…
By using totally isotropic subspaces in an orthogonal space Omega^{+}(2i,2), several infinite families of packings of 2^k-dimensional subspaces of real 2^i-dimensional space are constructed, some of which are shown to be optimal packings. A…
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…
Dimension profiles were introduced by Falconer and Howroyd to provide formulae for the box-counting and packing dimensions of the orthogonal projections of a set E or a measure on Euclidean space onto almost all m-dimensional subspaces. The…
We survey the construction of a range of function spaces used in harmonic analysis of PDE, including classical results as well as recent developments. We frame these constructions in a common conceptual framework, where these function…
Dense packing of particles has provided important models to study the structure of matter in various systems such as liquid, glassy and crystalline phase, etc. The simplest sphere packing models are able to represent and capture salient…
We use non-perturbative U-duality symmetries of type II strings to construct new vacuum solutions. In some ways this generalizes the F-theory vacuum constructions. We find the possibilities of new vacuum constructions are very limited.…
In this paper we construct multidimensional codes with high dimension. The codes can correct high dimensional errors which have the form of either small clusters, or confined to an area with a small radius. We also consider small number of…
This article concludes the comprehensive study started in [Sz5], where the first non-trivial isospectral pairs of metrics are constructed on balls and spheres. These investigations incorporate 4 different cases since these balls and spheres…
Starting from the geometrical concept of a 4-dimensional de-Sitter configuration of spheres in Euclidean 3-space and modelling voids in the Universe as spheres, we show that a uniform distribution over this configuration space implies a…
This paper provides a survey of spherical designs and their applications, with a particular emphasis on the perspective of ``numerical analysis''. A set \(X_N\) of \(N\) points on the unit sphere \(\mathbb{S}^d\) is called a…
Sliced Sudoku-based space-filling designs and, more generally, quasi-sliced orthogonal array-based space-filling designs are useful experimental designs in several contexts, including computer experiments with categorical in addition to…
Dimension reduction is an important tool for analyzing high-dimensional data. The predictor envelope is a method of dimension reduction for regression that assumes certain linear combinations of the predictors are immaterial to the…
The Cohn-Elkies linear program for sphere packing, which was used to solve the 8 and 24 dimensional cases, is conjectured to not be sharp in any other dimension $d>2$. By mapping feasible points of this infinite-dimensional linear program…