A smaller cover of the moser’s worm problem

© 2018, Chiang Mai University. All rights reserved. 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.2604...

Full description

Saved in:

Bibliographic Details
Main Authors:	Nattapol Ploymaklam, Wacharin Wichiramala
Format:	Journal
Published:	2018
Subjects:	Biochemistry, Genetics and Molecular Biology Chemistry Materials Science Mathematics Physics and Astronomy
Online Access:	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85056428911&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62569
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Chiang Mai University

id	th-cmuir.6653943832-62569
record_format	dspace
spelling	th-cmuir.6653943832-625692018-11-29T07:57:05Z A smaller cover of the moser’s worm problem Nattapol Ploymaklam Wacharin Wichiramala Biochemistry, Genetics and Molecular Biology Chemistry Materials Science Mathematics Physics and Astronomy © 2018, Chiang Mai University. All rights reserved. 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. 2018-11-29T07:32:38Z 2018-11-29T07:32:38Z 2018-09-01 Journal 01252526 2-s2.0-85056428911 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85056428911&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62569
institution	Chiang Mai University
building	Chiang Mai University Library
country	Thailand
collection	CMU Intellectual Repository
topic	Biochemistry, Genetics and Molecular Biology Chemistry Materials Science Mathematics Physics and Astronomy
spellingShingle	Biochemistry, Genetics and Molecular Biology Chemistry Materials Science Mathematics Physics and Astronomy Nattapol Ploymaklam Wacharin Wichiramala A smaller cover of the moser’s worm problem
description	© 2018, Chiang Mai University. All rights reserved. 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	Journal
author	Nattapol Ploymaklam Wacharin Wichiramala
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
publishDate	2018
url	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85056428911&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62569
_version_	1681425831634665472

A smaller cover of the moser’s worm problem

Similar Items