Related papers: A combinatorial criterion for macroscopic circles …
We have studied the contact network properties of two and three dimensional polydisperse, frictionless sphere packings at the random closed packing density through simulations. We observe universal correlations between particle size and…
In this paper we consider the problem of packing a fixed number of identical circles inside the unit circle container, where the packing is complicated by the presence of fixed size circular prohibited areas. Here the objective is to…
We investigate criteria for circle packing(CP) types of disk triangulation graphs embedded into simply connected domains in $ \mathbb{C}$. In particular, by studying combinatorial curvature and the combinatorial Gauss-Bonnet theorem…
We establish a new connection between metric Diophantine approximation and the parametric geometry of numbers by proving a variational principle facilitating the computation of the Hausdorff and packing dimensions of many sets of interest…
The conformational statistics of ring polymers in melts or dense solutions is strongly affected by their quenched microscopic topological state. The effect is particularly strong for untangled (i.e. non-concatenated and unknotted) rings,…
The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…
\textit{Parastichies} are spiral patterns observed in plants and numerical patterns generated using golden angle method. We generalize this method by using Markoff theory and the theory of product of linear forms, to obtain a theory for…
We study the size-topology relations in random packings of dry adhesive polydisperse microspheres with Gaussian and lognormal size distributions through a geometric tessellation. We find that the dependence of the neighbour number on the…
Using methods of conformal field theory, we conjecture an exact form for the probability that n distinct clusters span a large rectangle or open cylinder of aspect ratio k, in the limit when k is large.
This text is based on a lecture for the Sheffield Probability Day; its main purpose is to survey some recent asymptotic results about Bernoulli bond percolation on certain large random trees with logarithmic height. We also provide a…
Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\'{o}lya trees: a uniform random P\'{o}lya tree of size $n$ consists of a conditioned critical…
We studied the geometrical and topological rules underlying the dispositions and the size distribution of non-overlapping, polydisperse circle-packings. We found that the size distribution of circles that densely cover a plane follows the…
Let $\Gamma$ denote the mapping class group of the plane minus a Cantor set. We show that every action of $\Gamma$ on the circle is either trivial or semi-conjugate to a unique minimal action on the so-called simple circle.
The famous tree packing conjecture of Gy\'arf\'as from 1976 says that any sequence of trees $T_1,\ldots,T_n$ such that $|T_i|=i$ for each $i\in [n]$ packs into the complete $n$-vertex graph $K_n$. Packing even just the largest trees in such…
We prove that the `Upper Matching Conjecture' of Friedland, Krop, and Markstr\"om and the analogous conjecture of Kahn for independent sets in regular graphs hold for all large enough graphs as a function of the degree. That is, for every…
What particle shape will generate the highest packing fraction when randomly poured into a container? In order to explore and navigate the enormous search space efficiently, we pair molecular dynamics simulations with artificial evolution.…
A simple proof of Thue theorem on Circle Packing is given. The proof is only based on density analysis of Delaunay triangulation for the set of points that are centers of circles in a saturated circle configuration.
We examine connections between combinatorial notions that arise in machine learning and topological notions in cubical/simplicial geometry. These connections enable to export results from geometry to machine learning. Our first main result…
A well-known theorem of Rodin \& Sullivan, previously conjectured by Thurston, states that the circle packing of the intersection of a lattice with a simply connected planar domain $\Omega$ into the unit disc $\mathbb{D}$ converges to a…
We completely describe in terms of Hausdorff measures the size of the set of points of the circle that are covered infinitely often by a sequence of random arcs with given lengths. We also show that this set is a set with large…