Wetzel's sector covers unit arcs

DOI10.1007/S10998-020-00354-XMaRDI QIDQ2043720zbMATH OpenOpenAlexFDO

Authors Chatchawan Panraksa, Wacharin Wichiramala

Publication date 3 August 2021

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

covering by convex setscovering of unit arcsplanar arcsectorial coverssupport lineworm problem

Mathematics Subject Classification ID

Length, area, volume and convex sets (aspects of convex geometry) (52A38)

Abstract: We settle J. Wetzel's 1970's conjecture and show that a 30{^circ} circular sector of unit radius can accommodate every planar arc of unit length. Leo Moser asked in 1966 for the smallest (convex) region in the plane that can accommodate each arc of unit length. With area {pi}/12, this sector is the smallest such set presently known. Moser's question has prompted a multitude of papers on related problems over the past 50 years, most remaining unanswered.

Review text

The authors confirm the conjecture of \textit{J. E. Wetzel} [Can. Mat. Bull. 16, 367--375 (1973; Zbl 0271.52016)] that the \(30^\circ\) circular sector of radius \(1\) contains a congruent copy of an arbitrary arc of unit length. This universal cover for arcs of unit length has area smaller than other earlier found such covers.

Recommendations

• Sectorial covers for unit arcs
• Besicovitch triangles cover unit arcs
• Bounds for covers of unit arcs
• Drapeable unit arcs fit in the unit \(30^\circ\) sector
• A smaller cover for convex unit arcs
• A small cover for convex unit arcs
• \(z\)-arcs in the thirty degrees sector
• Sectrix curves on the sphere
• The broadest three-segment unit arc
• Covering \(n\)-segment unit arcs is not sufficient

Cites work

• \(\Lambda\)-configuration and embedding
• A covering theorem for families of sets in R^d
• An improved upper bound for worm problem
• Besicovitch triangles cover unit arcs
• Bounds for covers of unit arcs
• Drapeable unit arcs fit in the unit \(30^\circ\) sector
• Fits and Covers
• Lower bound for convex hull area and universal cover problems
• Problems, problems, problems
• Sectorial Covers for Curves of Constant Length
• Sectorial covers for unit arcs
• The worm problem of Leo Moser

Cited in

(7)

• Drapeable unit arcs fit in the unit \(30^\circ\) sector
• \(z\)-arcs in the thirty degrees sector
• \(\Lambda\)-configuration and embedding
• Lower bound of length of triangle inscribed in a circle on non-Euclidean spaces
• Sectorial covers for unit arcs
• Universal convex covering problems under translations and discrete rotations
• Recent advances in the worm problem

This page was built for publication: Wetzel's sector covers unit arcs

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