betaFeedback

WorksMathematics

Optimal Radius Ratio of Compact Nonuniform Packings

Abstract

We study the ratio of the smallest to the largest radius in a nonuniform disk packing whose tangency graph triangulates the plane. We give a computer-assisted proof that the largest possible ratio is s=0.651050185882609…s=0.651050185882609\ldots, attained uniquely up to similarity by packing~53 of Fernique, Hashemi, and Sizova. In fact, every nonuniform packing with radius ratio at least 0.651050.65105 is similar to this packing. No periodicity or restriction on the number of radii is assumed; the radii are required only to have a positive infimum and a finite supremum. Following the finite-subgraph exclusion program of Connelly and Zhang, we first restrict the degree-five flowers and their pairings. The remaining exceptional degree-seven corona forces seventeen complete flowers on an unfolded disk with thirty-seven labels. An exact interval certificate excludes their angle equations. A comparison of logarithmic radii on a recurrent network then forces the radii and the three local degree words. We identify the entire triangulation by reducing these words to the square–octagon tiling and showing that its decoration is forced.

Paper details

vlnc:W_32wywcrh
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…