Wetzel's sector covers unit arcs
From MaRDI portal
Publication:2043720
DOI10.1007/S10998-020-00354-XzbMATH Open1488.52009arXiv1907.07351OpenAlexW3045755689MaRDI QIDQ2043720FDOQ2043720
Authors: Chatchawan Panraksa, Wacharin Wichiramala
Publication date: 3 August 2021
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1907.07351
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
- Fits and Covers
- Besicovitch triangles cover unit arcs
- Sectorial Covers for Curves of Constant Length
- Problems, problems, problems
- The worm problem of Leo Moser
- A covering theorem for families of sets in \(\mathbb R^d\)
- An improved upper bound for worm problem
- Drapeable unit arcs fit in the unit \(30^\circ\) sector
- Sectorial Covers for Unit Arcs
- \(\Lambda\)-configuration and embedding
- LOWER BOUND FOR CONVEX HULL AREA AND UNIVERSAL COVER PROBLEMS
- Title not available (Why is that?)
Cited In (4)
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)