On optimal λ-separable packings in the plane
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Let P be a packing of circular disks of radius ρ > 0 in the Euclidean, spherical, or hyperbolic plane. Let 0 ≤ λ ≤ ρ. We say that P is a λ-separable packing of circular disks of radius ρ if the family P′ of disks concentric to the disks of P having radius λ form a totally separable packing, i.e., any two disks of P′ can be separated by a line which is disjoint from the interior of every disk of F′. This notion bridges packings of circular disks of radius ρ (with λ = 0) and totally separable packings of circular disks of radius ρ (with λ = ρ). In this note we extend several theorems on the density, tightness, and contact numbers of disk packings and totally separable disk packings to λ-separable packings of circular disks of radius ρ in the Euclidean, spherical, and hyperbolic plane. In particular, our upper bounds (resp., lower bounds) for the density (resp., tightness) of λ-separable packings of unit disks in the Euclidean plane are sharp for all 0 ≤ λ ≤ 1 with the extremal values achieved by λ-separable lattice packings of unit disks. On the other hand, the bounds of similar results in the spherical and hyperbolic planes are not sharp for all 0 ≤ λ ≤ ρ although they do not seem to be far from the relevant optimal bounds either. The proofs use local analytic and elementary geometry and are based on the so-called refined Molnár decomposition, which is obtained from the underlying Delaunay decomposition and as such might be of independent interest.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it