A Smaller Cover of the Moser’s Worm Problem
The Moser’s worm problem asks for a smallest set on the plane that contains a congruent copy of every unit arc. Such smallest covering set has not been found yet. The smallest known cover constructed by Norwood and Poole in 2003 [6] has area 0.260437. In this work, we adapt their idea to construct a...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | บทความวารสาร |
| Language: | English |
| Published: |
Science Faculty of Chiang Mai University
2019
|
| Online Access: | http://it.science.cmu.ac.th/ejournal/dl.php?journal_id=9538 http://cmuir.cmu.ac.th/jspui/handle/6653943832/64225 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Language: | English |
| id |
th-cmuir.6653943832-64225 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-642252019-05-07T09:59:53Z A Smaller Cover of the Moser’s Worm Problem Nattapol Ploymaklam Wacharin Wichiramala The Moser’s worm problem asks for a smallest set on the plane that contains a congruent copy of every unit arc. Such smallest covering set has not been found yet. The smallest known cover constructed by Norwood and Poole in 2003 [6] has area 0.260437. In this work, we adapt their idea to construct a smaller cover of area 0.26007. We also simplify the proof that the set constructed this way contains a congruent copy of every unit arc. 2019-05-07T09:59:53Z 2019-05-07T09:59:53Z 2018 บทความวารสาร 0125-2526 http://it.science.cmu.ac.th/ejournal/dl.php?journal_id=9538 http://cmuir.cmu.ac.th/jspui/handle/6653943832/64225 Eng Science Faculty of Chiang Mai University |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| language |
English |
| description |
The Moser’s worm problem asks for a smallest set on the plane that contains a congruent copy of every unit arc. Such smallest covering set has not been found yet. The smallest known cover constructed by Norwood and Poole in 2003 [6] has area 0.260437. In this work, we adapt their idea to construct a smaller cover of area 0.26007. We also simplify the proof that the set constructed this way contains a congruent copy of every unit arc. |
| format |
บทความวารสาร |
| author |
Nattapol Ploymaklam Wacharin Wichiramala |
| spellingShingle |
Nattapol Ploymaklam Wacharin Wichiramala A Smaller Cover of the Moser’s Worm Problem |
| author_facet |
Nattapol Ploymaklam Wacharin Wichiramala |
| author_sort |
Nattapol Ploymaklam |
| title |
A Smaller Cover of the Moser’s Worm Problem |
| title_short |
A Smaller Cover of the Moser’s Worm Problem |
| title_full |
A Smaller Cover of the Moser’s Worm Problem |
| title_fullStr |
A Smaller Cover of the Moser’s Worm Problem |
| title_full_unstemmed |
A Smaller Cover of the Moser’s Worm Problem |
| title_sort |
smaller cover of the moser’s worm problem |
| publisher |
Science Faculty of Chiang Mai University |
| publishDate |
2019 |
| url |
http://it.science.cmu.ac.th/ejournal/dl.php?journal_id=9538 http://cmuir.cmu.ac.th/jspui/handle/6653943832/64225 |
| _version_ |
1681426042049265664 |