betaFeedback

WorksMathematics

Small cells in great-circle arrangements

Abstract

We study the areas of the cells determined by an arrangement A\mathcal{A} of nn distinct great circles on the unit sphere, with no three concurrent. Let m(A)m(\mathcal{A}) and M(A)M(\mathcal{A}) denote the smallest and largest cell areas, respectively. Our first result is the bound m(A)≤C∗+O(n−3/4)n2,C∗=7.0666071493…, m(\mathcal{A})\le \frac{C_*+O(n^{-3/4})}{n^2}, \qquad C_*=7.0666071493\ldots , where the implied constant is absolute. This improves the coefficient π2π^2 obtained from classical polygonal perimeter estimates. We also prove that M(A)/m(A)>13M(\mathcal{A})/m(\mathcal{A})>13 for all sufficiently large nn, improving the bound 7.437.43 of L.~Fejes Tóth. The main tool is a perimeter inequality for planar polygons which takes account of their exterior angles. We combine this with a positive semidefinite kernel on the sphere and use gnomonic projection to obtain bounds for spherical cells.

Paper details

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

views · 5

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…