Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/62569
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNattapol Ploymaklamen_US
dc.contributor.authorWacharin Wichiramalaen_US
dc.date.accessioned2018-11-29T07:32:38Z-
dc.date.available2018-11-29T07:32:38Z-
dc.date.issued2018-09-01en_US
dc.identifier.issn01252526en_US
dc.identifier.other2-s2.0-85056428911en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85056428911&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/62569-
dc.description.abstract© 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.en_US
dc.subjectBiochemistry, Genetics and Molecular Biologyen_US
dc.subjectChemistryen_US
dc.subjectMaterials Scienceen_US
dc.subjectMathematicsen_US
dc.subjectPhysics and Astronomyen_US
dc.titleA smaller cover of the moser’s worm problemen_US
dc.typeJournalen_US
article.title.sourcetitleChiang Mai Journal of Scienceen_US
article.volume45en_US
article.stream.affiliationsChiang Mai Universityen_US
article.stream.affiliationsChulalongkorn Universityen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.