论文信息 - A Lower Bound for Lebesgue's Universal Cover Problem

A Lower Bound for Lebesgue's Universal Cover Problem

In the following we show that any convex set that contains a congruent copy of any set of diameter one (universal cover) has area at least 0.832. This considerably improves the lower bound for Lebesgue's universal cover problem, using a combination of computer search and geometric bounds.

PETER BRASS | M. Sharifi

[1] H. Eggleston,et al. Minimal universal covers inEn , 1963 .

[2] Heinrich W. E. Jung. Über den kleinsten Kreis, der eine ebene Figur einschließt. , 1910 .

[3] Herbert Meschkowski. Ungelöste und unlösbare Probleme der Geometrie , 1960 .

[4] H. C. Hansen. A small universal cover of figures of unit diameter , 1975 .

[5] Heinrich W. E. Jung. Ueber die kleinste Kugel, die eine räumliche Figur einschliesst. , 1901 .

[6] György Elekes. Generalized breadths, circular Cantor sets, and the least area UCC , 1994, Discret. Comput. Geom..

[7] H. C. Hansen. Small universal covers for sets of unit diameter , 1992 .