Related papers: Non-uniform packings
A disc packing in the plane is compact if its contact graph is a triangulation. There are $9$ values of $r$ such that a compact packing by discs of radii $1$ and $r$ exists. We prove, for each of these $9$ values, that the maximal density…
In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…
Discs form a compact packing of the plane if they are interior disjoint and the graph which connects the center of mutually tangent discs is triangulated. There is only one compact packing by discs all of the same size, called hexagonal…
In this paper, we introduce a notion of the center and radius of a subset A of metric space X. In the Euclidean spaces, this notion can be seen as the extension of the center and radius of open/closed balls. The center and radius of a…
We explore a definition of uniformity on noncompact manifolds that does not require a Riemannian metric, but is equivalent to bounded gemetry. These are unfinished research notes (and will likely never be published), but since they were…
Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…
We use the holonomic ansatz to estimate the asymptotic behavior, in $T$, of the average maximal number of balls in a bin that is obtained when one throws uniformly at random (without replacement) $r$ balls into $n$ bins, $T$ times. Our…
We show that for certain triangulations of surfaces, circle packings realising the triangulation can be found by solving a system of polynomial equations. We also present a similar system of equations for unbranched circle packings. The…
A homothetic packing of squares is any set of various-size squares with the same orientation where no two squares have overlapping interiors. If all $n$ squares have the same size then we can have up to roughly $4n$ contacts by arranging…
We prove that, for every polyhedral or $C^1$ norm on $\mathbb{R}^d$ and every set $E \subseteq \mathbb{R}^d$ of packing dimension $s$, the packing dimension of the distance set of $E$ with respect to that norm is at least $\tfrac{s}{d}$.…
We prove topological regularity results for isoperimetric sets in PI spaces having a suitable deformation property, which prescribes a control on the increment of the perimeter of sets under perturbations with balls. More precisely, we…
For a finite set of balls of radius $r$, the $k$-fold cover is the space covered by at least $k$ balls. Fixing the ball centers and varying the radius, we obtain a nested sequence of spaces that is called the $k$-fold filtration of the…
The aim of this work is to expose some asymptotic series associated to some expressions involving the volume of the n-dimensional unit ball. All proofs and the methods used for improving the classical inequalities announced in the final…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…
We prove a fairly general inequality that estimates the number of lattice points in a ball of positive radius in general position in a Euclidean space. The bound is uniform over lattices induced by a matrix having a bounded operator norm.
Replication is a key technique in the design of efficient and reliable distributed systems. As information grows, it becomes difficult or even impossible to store all information at every replica. A common approach to deal with this problem…
Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent…
We define a natural compactification of an arrangement complement in a ball quotient. We show that when this complement has a moduli space interpretation, then this compactification is often one that appears naturally by means of geometric…
We prove explicit bounds on the radius of a ball centered at the origin which is guaranteed to contain all bounded connected components of a semi-algebraic set $S \subset \mathbbm{R}^k$ defined by a quantifier-free formula involving $s$…