Related papers: Cutting self-similar space-filling sphere packings
There are various notions of dimension in fractal geometry to characterise (random and non-random) subsets of $\mathbb R^d$. In this expository text, we discuss their analogues for infinite subsets of $\mathbb Z^d$ and, more generally, for…
The fractal cosmological model which accounts for observable fractal properties of the Universe's large-scale structure is constructed. In this framework these properties are consequences of the rotary symmetry of charged scalar meson…
We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases, these packings are in fact optimal. When applied to the previously…
The evolution and spatial structure of displacement fronts in fractures with self-affine rough walls are studied by numerical simulations. The fractures are open and the two faces are identical but shifted along their mean plane, either…
Covering a network with the minimum possible number of boxes can reveal interesting features for the network structure, especially in terms of self-similar or fractal characteristics. Considerable attention has been recently devoted to this…
Smooth and curved microstructural topologies found in nature - from soap films to trabecular bone - have inspired several mimetic design spaces for architected metamaterials and bio-scaffolds. However, the design approaches so far have been…
We review the superspace technique to determine supersymmetric spacetimes in the framework of off-shell formulations for supergravity in diverse dimensions using the case of 3D N=2 supergravity theories as an illustrative example. This…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
We investigate the interaction between two cracks propagating in a thin sheet. Two different experimental geometries allow us to tear sheets by imposing an out-of-plane shear loading. We find that two tears converge along self-similar paths…
The main goal of this paper has a double purpose. On the one hand, we propose a new definition in order to compute the fractal dimension of a subset respect to any fractal structure, which completes the theory of classical box-counting…
We provide an informal discussion of pattern formation in a finite universe. The global size and shape of the universe is revealed in the pattern of hot and cold spots in the cosmic microwave background. Topological pattern formation can be…
The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that…
The fractal structure of spin clusters and their boundaries in the critical two-dimensional (2D) Ising model is investigated numerically. The fractal dimensions of these geometrical objects are estimated by means of Monte Carlo simulations…
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…
It is known that spherically symmetric static spacetimes admit a foliation by {\deg}at hypersurfaces. Such foliations have explicitly been constructed for some spacetimes, using different approaches, but none of them have proved or even…
Fractals are geometric shapes that can display complex and self-similar patterns found in nature (e.g., clouds and plants). Recent works in visual recognition have leveraged this property to create random fractal images for model…
A folded disk is bistable, as it can be popped through to an inverted state with elastic energy localized in a small, highly-deformed region on the fold. Cutting out this singularity relaxes the surrounding material and leads to a loss of…
This paper shows that in dimensions n \geq 2 for any partition of the set of points in the standard n-sphere \sum_{i=0}^n x_i^2 =1 in R^{n+1} into (n+3) or more nonempty sets, there exists a hyperplane in R^{n+1} that intersects at least…
A method to visualize polytopes in a four dimensional euclidian space $(x,y,z,w)$ is proposed. A polytope is sliced by multiple hyperplanes that are parallel each other and separated by uniform intervals. Since the hyperplanes are…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…