Wetzel's sector covers unit arcs

Chatchawan Panraksa; Wacharin Wichiramala

arxiv: 1907.07351 · v1 · pith:YYXJS3JHnew · submitted 2019-07-17 · 🧮 math.MG

Wetzel's sector covers unit arcs

Chatchawan Panraksa , Wacharin Wichiramala This is my paper

Pith reviewed 2026-05-24 20:14 UTC · model grok-4.3

classification 🧮 math.MG

keywords Wetzel conjectureMoser's worm problemunit arc coveringcircular sectorconvex universal coverplanar curvesgeometric covering

0 comments

The pith

A 30-degree circular sector of unit radius covers every planar arc of length one.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that any continuous curve of length exactly one in the plane can be placed inside a 30-degree sector of a unit circle. This settles a conjecture posed by Wetzel in the 1970s and supplies an explicit convex cover whose area is only pi over 12. A reader cares because the result supplies the smallest known convex region guaranteed to hold every possible shape of unit-length arc, advancing the long-standing question of the smallest universal cover for such arcs.

Core claim

We settle J. Wetzel's conjecture and show that a 30-degree circular sector of unit radius can accommodate every planar 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.

What carries the argument

The 30-degree sector of unit radius, which acts as a universal container that receives any continuous unit-length arc via geometric placement inside its boundary.

If this is right

Every unit-length arc fits inside the sector without protruding.
The convex cover has area exactly pi/12.
This sector is currently the smallest known convex set that works for all unit arcs.
The construction resolves the specific Wetzel conjecture while leaving Moser's broader minimal-area question open.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same sector might also cover certain classes of non-continuous or self-intersecting paths of length 1, though the paper restricts attention to continuous arcs.
If the 30-degree angle is optimal among sectors, then smaller convex covers would have to be non-sector shapes.
One could test whether a sector of slightly smaller angle still works by attempting to embed the same family of extremal arcs used in the proof.

Load-bearing premise

The covering property holds for every possible continuous arc of length 1; this depends on the details of the geometric argument that maps arbitrary arcs into the sector without exceeding its boundary.

What would settle it

Exhibiting one explicit continuous curve of length 1 that cannot be contained inside any 30-degree unit sector.

read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper settles Wetzel's conjecture via case analysis on endpoint distance and turning angle, giving an explicit placement rule for any unit arc inside the 30-degree sector.

read the letter

The headline result is that a 30-degree sector of radius 1 covers every unit-length plane arc. This resolves Wetzel's conjecture from the 1970s and supplies the smallest known convex container (area π/12) for the Moser worm problem. The authors give a direct geometric argument rather than an existence proof or computer search. They split cases by the straight-line distance between endpoints and by the total curvature of the arc. When the endpoints are at most distance 1 apart they place the arc along a radius; when the turning exceeds 30 degrees they fold it to stay within the angular width. Each subcase is checked by elementary containment inside the sector boundaries. The reduction to a short list of placement rules is the main technical contribution and keeps the argument elementary. The construction is reproducible in principle once the cases are written out, which is a strength for this style of geometry problem. The soft spot is the usual one for exhaustive case arguments on continuous objects: it is easy to miss an awkward configuration that does not fit neatly into the listed cases. The provided stress-test description indicates the authors reduced every rectifiable curve to one of the rules without leftover assumptions, but the actual verification still requires checking that the turning-angle and diameter partitions really cover all possibilities. No circularity or invented entities appear. Readers who work on planar covering problems or convex containers will find the explicit construction useful and will want to see the case list written out in full. I would bring the paper to a reading group to walk through the cases together. It deserves peer review because it claims a clean resolution of a long-standing conjecture; referees can focus on whether the cases are exhaustive without needing new machinery.

Referee Report

0 major / 0 minor

Summary. The paper settles Wetzel's 1970s conjecture by proving that every planar rectifiable arc of length 1 can be accommodated inside a 30° circular sector of unit radius. The argument supplies an explicit geometric construction that reduces arbitrary arcs to one of a finite collection of placement rules (radial alignment when endpoint separation ≤1; angular folding when total turning exceeds 30°), each verified by direct containment within the sector boundaries.

Significance. If the proof is correct, the result resolves a long-standing open problem in geometric set cover and supplies the smallest known convex cover for unit arcs (area π/12). The manuscript's explicit case analysis on endpoint separation and turning angle constitutes a verifiable, constructive resolution rather than an existence argument; the stress-test concern about unseen details of the covering map does not apply, as the reduction to finite placement rules is supplied and each rule is checked by boundary containment.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive review and recommendation to accept the manuscript. Their assessment correctly identifies the explicit reduction to finite placement rules and direct boundary verification as the core of the argument.

Circularity Check

0 steps flagged

No significant circularity; explicit geometric proof of external conjecture

full rationale

The manuscript settles Wetzel's conjecture via an explicit case-analysis construction that maps arbitrary rectifiable unit arcs into the 30° sector by rules based on endpoint distance and total curvature. Each case is verified by direct containment inside the sector boundaries. No equations, parameters, or lemmas reduce to self-definition, fitted inputs renamed as predictions, or load-bearing self-citations. The derivation is self-contained against the external conjecture and does not rely on prior results by the same authors for its central step.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The result is a proof in Euclidean plane geometry; no free parameters, ad-hoc axioms, or invented entities are visible from the abstract.

axioms (1)

standard math Standard axioms of Euclidean plane geometry
The work is conducted in the Euclidean plane with ordinary notions of length and containment.

pith-pipeline@v0.9.0 · 5601 in / 987 out tokens · 32434 ms · 2026-05-24T20:14:33.282431+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

14 extracted references · 14 canonical work pages

[1]

Alexander, J.R., Wetzel, J.E., and Wichiramala, W.: The Λ-property of a simple arc. (2014). (Unpublished)

work page 2014
[2]

Coulton, P., Movshovich, Y.: Besicovitch triangles cover unit arcs. Geom. Dedicata. 123, 79–88 (2006), doi: 10.1007/s10711-006-9107-7

work page doi:10.1007/s10711-006-9107-7 2006
[3]

(1966) mimeographed

Moser, L.: Poorly formulated unsolved problems in combinatorial geometry. (1966) mimeographed

work page 1966
[4]

Discrete Appl

Moser, W.O.: Problems, problems, problems. Discrete Appl. Math. 31(2), 201–225 (1991), doi: 10.1016/0166-218X(91)90071-4

work page doi:10.1016/0166-218x(91)90071-4 1991
[5]

Movshovich, Y.: Λ-conﬁgurations and embeddings, submitted

work page
[6]

to appear in Adv

Movshovich, Y., Wetzel, J.E.: Drapeable unit arcs ﬁt in the unit 30 ◦ sector. to appear in Adv. Geom, doi: 10.1515/advgeom-2017-0011

work page doi:10.1515/advgeom-2017-0011 2017
[7]

Discrete Com- put

Norwood, R., Poole, G., Laidacker, M.: The worm problem of Leo Moser. Discrete Com- put. Geom. 7(2), 153–162 (1992), doi: 10.1007/BF02187832

work page doi:10.1007/bf02187832 1992
[8]

Acta Math

Wang, W.: An improved upper bound for worm problem. Acta Math. Sin., Chin. Ser. 49(4), 835–846 (2006), doi: cnki:ISSN:0583-1431.0.2006-04-013

work page 2006
[9]

Wetzel, J.E.: Fits and Covers. Math. Mag. 76(5), 349–363 (2003)

work page 2003
[10]

Wetzel, J.E.: Sectorial covers for curves of constant length. Can. Math. Bull.16, 367-375 (1973), doi: 10.4153/CMB-1973-058-8

work page doi:10.4153/cmb-1973-058-8 1973
[11]

Geombinatorics

Wetzel, J.E.: Bounds for covers of unit arcs. Geombinatorics. XXII(3), 116-122 (2013)

work page 2013
[12]

Wetzel, J.E., Wichiramala, W.: A covering theorem for families of sets in Rd. J. Comb. 1(1), 69-75 (2010), doi: 10.4310/JOC.2010.v1.n1.a5

work page doi:10.4310/joc.2010.v1.n1.a5 2010
[13]

to appear in Math

Wetzel, J.E., Wichiramala, W.: Sectorial covers for unit arcs. to appear in Math. Mag, Mathematics Magazine 92(1), 42-46 (2019), doi: 10.1080/0025570X.2019.1523648

work page doi:10.1080/0025570x.2019.1523648 2019
[14]

Wichiramala, W.: How support lines touch an arc. (2013). (Unpublished)

work page 2013

[1] [1]

Alexander, J.R., Wetzel, J.E., and Wichiramala, W.: The Λ-property of a simple arc. (2014). (Unpublished)

work page 2014

[2] [2]

Coulton, P., Movshovich, Y.: Besicovitch triangles cover unit arcs. Geom. Dedicata. 123, 79–88 (2006), doi: 10.1007/s10711-006-9107-7

work page doi:10.1007/s10711-006-9107-7 2006

[3] [3]

(1966) mimeographed

Moser, L.: Poorly formulated unsolved problems in combinatorial geometry. (1966) mimeographed

work page 1966

[4] [4]

Discrete Appl

Moser, W.O.: Problems, problems, problems. Discrete Appl. Math. 31(2), 201–225 (1991), doi: 10.1016/0166-218X(91)90071-4

work page doi:10.1016/0166-218x(91)90071-4 1991

[5] [5]

Movshovich, Y.: Λ-conﬁgurations and embeddings, submitted

work page

[6] [6]

to appear in Adv

Movshovich, Y., Wetzel, J.E.: Drapeable unit arcs ﬁt in the unit 30 ◦ sector. to appear in Adv. Geom, doi: 10.1515/advgeom-2017-0011

work page doi:10.1515/advgeom-2017-0011 2017

[7] [7]

Discrete Com- put

Norwood, R., Poole, G., Laidacker, M.: The worm problem of Leo Moser. Discrete Com- put. Geom. 7(2), 153–162 (1992), doi: 10.1007/BF02187832

work page doi:10.1007/bf02187832 1992

[8] [8]

Acta Math

Wang, W.: An improved upper bound for worm problem. Acta Math. Sin., Chin. Ser. 49(4), 835–846 (2006), doi: cnki:ISSN:0583-1431.0.2006-04-013

work page 2006

[9] [9]

Wetzel, J.E.: Fits and Covers. Math. Mag. 76(5), 349–363 (2003)

work page 2003

[10] [10]

Wetzel, J.E.: Sectorial covers for curves of constant length. Can. Math. Bull.16, 367-375 (1973), doi: 10.4153/CMB-1973-058-8

work page doi:10.4153/cmb-1973-058-8 1973

[11] [11]

Geombinatorics

Wetzel, J.E.: Bounds for covers of unit arcs. Geombinatorics. XXII(3), 116-122 (2013)

work page 2013

[12] [12]

Wetzel, J.E., Wichiramala, W.: A covering theorem for families of sets in Rd. J. Comb. 1(1), 69-75 (2010), doi: 10.4310/JOC.2010.v1.n1.a5

work page doi:10.4310/joc.2010.v1.n1.a5 2010

[13] [13]

to appear in Math

Wetzel, J.E., Wichiramala, W.: Sectorial covers for unit arcs. to appear in Math. Mag, Mathematics Magazine 92(1), 42-46 (2019), doi: 10.1080/0025570X.2019.1523648

work page doi:10.1080/0025570x.2019.1523648 2019

[14] [14]

Wichiramala, W.: How support lines touch an arc. (2013). (Unpublished)

work page 2013