Exploring a Planet, Revisited

DOI10.1080/00029890.2022.2071569MaRDI QIDQ5094539zbMATH OpenOpenAlexFDO

Authors Yufei Zhao

Publication date 3 August 2022

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2110.04376

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Spherical and hyperbolic convexity (52A55) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Abstract: How should we place $n$ great circles on a sphere to minimize the furthest distance between a point on the sphere and its nearest great circle? Fejes T'oth conjectured that the optimum is attained by placing $n$ circles evenly spaced all passing through the north and south poles. This conjecture was recently proved by Jiang and Polyanskii. We present a short simplification of Ortega-Moreno's alternate proof of this conjecture.

Recommendations

• Exploring Endless Space
• scientific article; zbMATH DE number 1559557
• Exploring Unknown Environments
• scientific article; zbMATH DE number 3725752
• Another exploration problem

Cites work

• scientific article; zbMATH DE number 3060029 (Why is no real title available?)
• A Circle Covering Theorem
• A Solution of the "Plank Problem"
• An optimal plank theorem
• Exploring a Planet
• From Tarski's plank problem to simultaneous approximation
• Proof of László Fejes Tóth's zone conjecture
• Research Problems in Discrete Geometry
• THE COMPLEX PLANK PROBLEM

Cited in

(6)

• From the separable Tammes problem to extremal distributions of great circles in the unit sphere
• The complex plank problem, revisited
• Russian exploration of Venus: past and prospects
• Plank theorems and their applications: a survey
• Exploring Endless Space
• Extensions of polynomial plank covering theorems

This page was built for publication: Exploring a Planet, Revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094539)