Smallest maximal snakes of translates of convex domains (Q1900001): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01265297 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003227982 / rank
 
Normal rank

Latest revision as of 09:10, 30 July 2024

scientific article
Language Label Description Also known as
English
Smallest maximal snakes of translates of convex domains
scientific article

    Statements

    Smallest maximal snakes of translates of convex domains (English)
    0 references
    17 October 1995
    0 references
    A maximal snake of size \(n\) is a set \((K_1,\dots,K_n)\) of non-overlapping translates of a convex domain \(K\) in the plane, such that \(K_i\) touches \(K_j\) if and only if \(|i -j|= 1\) and no translate of \(K\) can touch \(K_1\) or \(K_n\) without intersecting an additional \(K_i\). The authors prove that the size of the smallest maximal snake is 11 if \(K\) is a parallelogram and 10 otherwise, thereby generalizing the corresponding theorem on circular disks. For the proof, some properties of Minkowski planes are studied in detail, and a modification of the usual notion of angles in such planes is introduced. For these angles, a partial ordering and a partial addition are defined. The angles of equilateral triangles turn out to be of particular importance.
    0 references
    Minkowski plane
    0 references
    maximal snake
    0 references
    0 references

    Identifiers