Related papers: Gap Distributions in Circle Packings
We consider packings of the plane using discs of radius 1 and r. A packing is compact if every disc D is tangent to a sequence of discs D_1, D_2, ..., D_n such that D_i is tangent to D_{i+1}. We prove that there are only nine values of r…
We have studied the distribution of forces in gravitational systems through numerical experiments. Data were taken from an N-body simulation in an expanding universe. Before clustering, the distribution of random forces was represented as a…
This paper addresses the question: given a scalar group, can we determine all the additions that transform this scalar group into a (near-)field? A key approach to addressing this problem involves transporting (near-)field structures via…
We propose a new class of space-filling designs called rotated sphere packing designs for computer experiments. The approach starts from the asymptotically optimal positioning of identical balls that covers the unit cube. Properly scaled,…
Given a Fourier transformable measure in two dimensions, we find a formula for the intensity of its Fourier transform along circles. In particular, we obtain a formula for the diffraction measure along a circle in terms of the…
In this paper, on envelopes created by circle families in the plane, all four basic problems (existence problem, representation problem, problem on the number of envelopes, problem on relationships of definitions) are solved.
Relativistic thick ring models are constructed using previously found analytical Newtonian potential-density pairs for flat rings and toroidal structures obtained from Kuzmin-Toomre family of discs. In particular, we present systems with…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…
We develop the theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There are two posets associated with this collection: the poset of faces and the poset of…
In this informal expository note, we quickly introduce and survey compactifications of strata of holomorphic 1-forms on Riemann surfaces, i.e. spaces of translation surfaces. In the last decade, several of these have been constructed,…
Discrete conformal mappings based on circle packing, vertex scaling, and related structures has had significant activity since Thurston proposed circle packing as a way to approximate conformal maps in the 1980s. The first convergence…
The problem of packing equal circles in a circle is a classic and famous packing problem, which is well-studied in academia and has a variety of applications in industry. This problem is computationally challenging, and researchers mainly…
The probability of plunging orbits is enhanced in groups of galaxies and indeed, observations show that ring galaxies, which are believed to form when a galaxy passes through the center of a larger rotating disk, are often found in small…
In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A representation of a graph from that class is given by the set of…
N-body simulations of galactic collisions are employed to investigate the formation of elliptical rings in disk galaxies. The relative inclination between disk and dwarf galaxies is studied with a fine step of five degrees. It is confirmed…
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…
We study the statistical distribution of the closest encounter between generic smooth observations computed along different trajectories of a rapidly mixing dynamical system. At the limit of large trajectories, we obtain a distribution of…
Measuring the similarity between patches in images is a fundamental building block in various tasks. Naturally, the patch-size has a major impact on the matching quality, and on the consequent application performance. We try to use large…
Predicting theoretically the highest density, which a disordered packing of discs can achieve, has been a long-standing unresolved problem. Such predictions are hindered by two difficulties - the dependence of the density on the packing…