A New Slant on Lebesgue’s Universal Covering Problem

Authors: Philip E Gibbs

Lebesgue’s universal covering problem is re-examined using computational methods. This leads to conjectures about the nature of the solution which if correct could provide a blueprint for a complete solution. Empirical lower bounds for the minimal area are computed using different hypotheses based on the conjectures. A new upper bound of 0.844112 for the area of the minimal cover is derived improving previous results. This method for determining the bound is suggested by the conjectures and computational observations but is proved independently of them. The key innovation is to modify previous best results by removing corners from a regular hexagon at a small slant angle to the edges of the dodecahedron used before. Simulations indicate that the minimum area for a convex universal cover is likely to be around 0.84408.

Comments: 24 Pages.

Download: PDF

Submission history

[v1] 2014-01-29 16:43:10
[v2] 2014-02-01 05:34:17
[v3] 2014-10-06 10:49:45

Unique-IP document downloads: 255 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus