相关论文: Cutting self-similar space-filling sphere packings

This paper describes a numerical method for finding good packings in Grassmannian manifolds equipped with various metrics. This investigation also encompasses packing in projective spaces. In each case, producing a good packing is…

A random sequential box-covering algorithm recently introduced to measure the fractal dimension in scale-free networks is investigated. The algorithm contains Monte Carlo sequential steps of choosing the position of the center of each box,…

Apollonian circle packings arise by repeatedly filling the interstices between mutually tangent circles with further tangent circles. In Euclidean space it is possible for every circle in such a packing to have integer radius of curvature,…

Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the orignial polytope are hereditary to its…

We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…

The desirable properties when constructing collections of subspaces often include the algebraic constraint that the projections onto the subspaces yield a resolution of the identity like the projections onto lines spanned by vectors of an…

The purpose of the present paper is to present the main applications of a new method for the determination of the fractal structure of plane curves. It is focused on the inverse problem, that is, given a curve in the plane, find its fractal…

Formerly the geometry was based on shapes, but since the last centuries this founding mathematical science deals with transformations, projections and mappings. Projective geometry identifies a line with a single point, like the perspective…

If a collection of identical particles is poured into a container, different shapes will fill to different densities. But what is the shape that fills a container as close as possible to a pre-specified, desired density? We demonstrate a…

The fractal properties of models of randomly placed $n$-dimensional spheres ($n$=1,2,3) are studied using standard techniques for calculating fractal dimensions in empirical data (the box counting and Minkowski-sausage techniques). Using…

Let a planar residual set be a set obtained by removing countably many disjoint topological disks from an open set in the plane. We prove that the residual set of a planar packing by curves that satisfy a certain lower curvature bound has…

We investigate dimension-theoretic properties of concentric topological spheres, which are fractal sets emerging both in pure and applied mathematics. We calculate the box dimension and Assouad spectrum of such collections, and use them to…

The present paper shows that for a given integer k greater than 2 it is possible to construct an at least k-differentiable Riemannian metric on the sphere of a certain dimension such that the cut locus of a point of it becomes a fractal.…

In this paper we study the hard sphere packing problem in the Hamming space by the cavity method. We show that both the replica symmetric and the replica symmetry breaking approximations give maximum rates of packing that are asymptotically…

We provide the first known upper bounds for the packing dimension of weighted singular and weighted $\omega$-singular matrices. We also prove upper bounds for these sets when intersected with fractal subsets. The latter results, even in the…

Many algorithms require discriminative boundaries, such as separating hyperplanes or hyperballs, or are specifically designed to work on spherical data. By applying inversive geometry, we show that the two discriminative boundaries can be…

Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex quadrangles of the same area and the same perimeter. As a byproduct we obtain vertex-to-vertex dissections of the…

A method of Proctor [European J. Combin. 5 (1984), no. 4, 331-350] realizes the set of arbitrary plane partitions in a box and the set of symmetric plane partitions as bases of linear representations of Lie groups. We extend this method by…

A space-filling function is a bijection from the unit line segment to the unit square, cube, or hypercube. The function from the unit line segment is continuous. The inverse function, while well-defined, is not continuous. Space-filling…

In this paper the excluded volume of binary similar hyperparticles with small size difference in D-dimensional Euclidean spaces R2, R3, and R4 is studied using two different statistical geometry approaches. These geometric approaches,…