Related papers: A game of packings
We develop an algorithm to construct new self-similar space-filling packings of spheres. Each topologically different configuration is characterized by its own fractal dimension. We also find the first bi-cromatic packing known up to now.
We exhibit a three parameter infinite family of quadratic recurrence relations inspired by the well known Somos sequences. For one infinite subfamily we prove that the recurrence generates an infinite sequence of integers by showing that…
In this article we study domino tilings of a family of finite regions called Aztec diamonds. Every such tiling determines a partition of the Aztec diamond into five sub-regions; in the four outer sub-regions, every tile lines up with nearby…
For any delta > 1 we construct a periodic and locally finite packing of the plane with ellipses whose delta-enlargement covers the whole plane. This answers a question of Imre B\'ar\'any. On the other hand, we show that if C is a packing in…
We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…
Compact packings are specific packings of spheres which can be seen as tilings and are good candidates to maximize the density. We show that the compact packings of the Euclidean space with two sizes of spheres are exactly those obtained by…
For each $n > 0$ there is a one complex parameter family of homeomorphisms of the circle consisting of linear fractional transformations `conjugated by $z \to z^n$'. We show that these families are free of relations, which determines the…
Tangential families are 1-parameter families of rays emanating tangentially from smooth curves. We classify tangential family germs up to Left-Right equivalence: we prove that there are two infinite series and four sporadic simple…
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…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
An oriented graph is a directed graph which can be obtained from a simple undirected graph by orienting its edges. In this paper we show that any oriented graph G on n vertices with minimum indegree and outdegree at least (1/2-o(1))n…
We study tangent sets of strictly self-affine sets in the plane. If a set in this class satisfies the strong separation condition and projects to a line segment for sufficiently many directions, then for each generic point there exists a…
We describe an algorithm that allows one to find dense packing configurations of a number of congruent disks in arbitrary domains in two or more dimensions. We have applied it to a large class of two dimensional domains such as rectangles,…
We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…
The entangled states that include every physical properties of particles would be important for both theoretical and applied physics. However, the existence and properties of such entangled states are unclear at present. Here we…
Tangencies correspond to singularities of impact systems, separating between impacting and non-impacting trajectory segments. The closure of their orbits constitute the singularity set, which, even in the simpler billiard limit, is known to…
We derive, in order of magnitude, the observed astrophysical and cosmological scales in the Universe, from neutron stars to superclusters of galaxies, up to, asymptotically, the observed radius of the Universe. This result is obtained by…
We find explicit formulas for the radii and locations of the circles in all the optimally dense packings of two, three or four equal circles on any flat torus, defined to be the quotient of the Euclidean plane by the lattice generated by…
Does combining a finite collection of objects infinitely many times guarantee the construction of a particular object? Here we use recursive function theory to examine the popular scenario of an infinite collection of typing monkeys…
Spiral Galaxies is a pencil-and-paper puzzle played on a grid of unit squares: given a set of points called centers, the goal is to partition the grid into polyominoes such that each polyomino contains exactly one center and is 180{\deg}…