Abstract
The least area α 2 of a convex set in the plane large enough to contain a congruent copy of every closed curve of length two lies between 0.385 and 0.491, as has been known for more than 38 years. We improve these bounds by showing that 0.386 < α 2 < 0.449.
Similar content being viewed by others
References
A. S. Besicovitch, On Kakeya’s problem and a similar one, Math. Zeit., 27 (1927), 312–320.
A. S. Besicovitch, Sur deux questions d’intégrabilité des fonctions, J. Soc. Phys. Math., 2 (1919), 105–123.
A. S. Besicovitch and R. Rado, A plane set of measure zero containing circumferences of every radius, J. London Math. Soc., 43 (1968), 717–719.
K. Bezdek and R. Connelly, Covering curves by translates of a convex set, Amer. Math. Monthly, 96 (1989), 789–806.
G. D. Chakerian and M. S. Klamkin, Minimal covers for closed curves, Math. Mag., 46 (1973), 55–61.
R. O. Davies, Some remarks on the Kakeya problem, Proc. Cambridge Philos. Soc., 69 (1971), 417–421.
I. Fáry and L. Rédei, Der zentralsymmetrische Kern und die zentralsymmetrische Hülle von konvexen Körpern, Math. Ann., 122 (1950), 205–220.
M. Fiedler, Two isoperimetric problems for Euclidean simplices, Topics in Discrete Mathematics (eds. M. Klazar et al.), Springer Verlag, New York, 2006, 65–69.
Z. Füredi and J. Wetzel, The smallest convex cover for triangles of perimeter two, Geom. Dedicata, 81 (2000), 285–293.
J. Håstad, S. Linusson and J. Wästlund, A smaller sleeping bag for a baby snake, Discrete Comput. Geom., 26 (2001), 173–181.
J. R. Kinney, A thin set of circles, Amer. Math. Monthly, 75 (1968), 1077–1081.
M. D. Kovalev, A minimal convex covering for triangles, Ukrain. Geom Sb., 26 (1983), 63–68 (in Russian).
B. Lindström, A sleeping bag for a baby snake, Math. Gaz., 81(492) (1997), 451–452.
J. M. Marstrand, An application of topological transformation groups to the Kakeya problem, Bull. London Math. Soc., 4 (1972), 191–195.
J. M. Marstrand, Packing smooth curves in R q, Mathematika, 26 (1979), 1–12.
L. Moser, Poorly formulated unsolved problems of combinatorial geometry, Mimeographed list (1966), reported at the Combinatorial Geometry Conference at East Lansing, March 1966. See in: William O. J. Moser, Problems, problems, problems, Discrete Appl. Math., 31 (1991), 201–225.
R. Norwood and G. Poole, An improved upper bound for Leo Moser’s worm problem, Discrete Comput. Geom., 29 (2003), 409–417.
R. Norwood, G. Poole and M. Laidacker, The worm problem of Leo Moser, Discrete Comput. Geom., 7 (1992), 153–162.
K. A. Post, Triangle in a triangle: on a problem of Steinhaus, Geom. Dedicata, 45 (1993), 115–120.
J. Schaer and J. Wetzel, Boxes for curves of constant length, Israel J. Math., 12 (1972), 257–265.
J. Wetzel, Fits and covers, Math. Mag., 76 (2003), 349–363.
D. J. Ward, A set of plane measure zero containing all finite polygonal arcs, Canad. J. Math., 22 (1970), 815–821.
W. Wichiramala, Personal communications, August 11, 2006, April 3, 2007, and January 15, 2009.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Imre Bárány
Research supported in part by the Hungarian NFSR under grants OTKA 69062 and 60427 and by the National Science Foundation under grant NSF DMS 09-01276 ARRA.
Rights and permissions
About this article
Cite this article
Füredi, Z., Wetzel, J.E. Covers for closed curves of length two. Period Math Hung 63, 1–17 (2011). https://doi.org/10.1007/s10998-011-7001-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10998-011-7001-z