Related papers: A Simple Proof of Thue's Theorem on Circle Packing

Thurston's circle packing approximation of the Riemann Mapping (proven to give the Riemann Mapping in the limit by Rodin-Sullivan) is largely based on the theorem that any topological disk with a circle packing metric can be deformed into a…

John Conway's Circle Theorem is a gem of plane geometry. The six points formed by continuing the sides of a triangle beyond every vertex by the length of its opposite side, are concyclic. The theorem has attracted several proofs. We present…

We solve Chui's conjecture on the simplest fractions (i.e., sums of Cauchy kernels with unit coefficients) in weighted (Hilbert) Bergman spaces. Namely, for a wide class of weights, we prove that for every $N$, the simplest fractions with…

Given a finite simple triangulation, we estimate the sizes of circles in its circle packing in terms of Cannon's vertex extremal length. Our estimates provide control over the size of the largest circle in the packing. We use them, combined…

This paper encompasses the mathematical derivations of the analytic and generalized formula and recurrence relations to find out the radii of n umber of circles inscribed or packed in the plane region bounded by circular arcs (including…

A formula for the radii and positions of four circles in the plane for an arbitrary linearly independent circle configuration is found. Among special cases is the recent extended Descartes Theorem on the Descartes configuration and an…

A new locally averaged density for sphere packing in R^3 is defined by a proper combination of the local cell (Voronoi cell) and Delaunay decompositions (\S 1.2.2), using only a single layer of surrounding spheres. Local packings attaining…

We present a self-contained short proof of the seminal result of Dillencourt (SoCG 1987 and DCG 1990) that Delaunay triangulations, of planar point sets in general position, are 1-tough. An important implication of this result is that…

The Andreev-Thurston Circle Packing Theorem is generalized to packings of convex bodies in planar simply connected domains. This turns out to be a useful tool for constructing conformal and quasiconformal mappings with interesting geometric…

We discuss the application of perturbation theory to a system of particles confined in a spherical box. A simple argument shows that the particles behave almost independently in sufficiently strong confinement. We choose the helium atom…

Thurston's sphere packing on a 3-dimensional manifold is a generalization of Thusrton's circle packing on a surface, the rigidity of which has been open for many years. In this paper, we prove that Thurston's Euclidean sphere packing is…

Tao conjectured that every dense subset of $\mathcal{P}^d$, the $d$-tuples of primes, contains constellations of any given shape. This was very recently proved by Cook, Magyar, and Titichetrakun and independently by Tao and Ziegler. Here we…

This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container…

It is showed that on a plane with a radial density the Four Vertex Theorem holds for the class of all simple closed curves if and only if the density is constant. But for the class of simple closed curves that are invariant under a rotation…

In this note we provide a simple approximation theory motivation for the circular kernel density estimation and further explore the usefulness of the wrapped Cauchy kernel in this context. It is seen that the wrapped Cauchy kernel appears…

In this thesis a connection between the worlds of discrete and continuous conformal geometry is explored. Specifically, a disk pattern production theroem is proved using an energy which measures how ``uniform'' the angle data of a…

A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.

In this note we exhibit a very simple proof of McNaughton Theorem, almost right out of the definitions, and at the same time we observe that this theorem does not depend of Chang's completeness theorem.

We prove a centre manifold theorem for a map along a manifold-with-boundary of fixed points, and provide an application to the study of gradient descent with large step size on two-layer matrix factorisation problems.

Using graph-theoretic methods we give a new proof that for all sufficiently large $n$, there exist sphere packings in $\R^n$ of density at least $cn2^{-n}$, exceeding the classical Minkowski bound by a factor linear in $n$. This matches up…