An improved upper bound for Leo Moser's worm problem (Q1404509): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00454-002-0774-3 / rank
Normal rank
 
Property / author
 
Property / author: George D. Poole / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Johann Linhart / rank
Normal rank
 
Property / author
 
Property / author: George D. Poole / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Johann Linhart / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-002-0774-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055396042 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00454-002-0774-3 / rank
 
Normal rank

Latest revision as of 19:31, 10 December 2024

scientific article
Language Label Description Also known as
English
An improved upper bound for Leo Moser's worm problem
scientific article

    Statements

    An improved upper bound for Leo Moser's worm problem (English)
    0 references
    0 references
    0 references
    21 August 2003
    0 references
    A worm is a continuous rectifiable arc of unit length in the Euclidean plane. Leo Mosers worm problem asks for the minimal area of a planar region \(C\) so that any worm is contained in \(C\) after a suitable rotation and translation. In the case \(C\) is convex, it is known that the area of \(C\) must lie between 0.21946 and 0.27524. Here the author reduces the upper bound to 0.260437, allowing \(C\) to be non-convex but simply connected. A corresponding region is constructed explicitly.
    0 references
    worm problem
    0 references
    cover
    0 references

    Identifiers