Convex polygons are cover-decomposable (Q2380774)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Convex polygons are cover-decomposable
scientific article

    Statements

    Convex polygons are cover-decomposable (English)
    0 references
    0 references
    0 references
    12 April 2010
    0 references
    It is proved that for every open polygon \(P\) there exists a constant \(k=k(P)\) such that every \(k\)-fold covering of the plane by translates of \(P\) can be decomposed into two coverings. The authors conjecture that there is a universal constant \(k\) such that every \(k\)-fold covering of the plane with translates of an arbitrary given quadrilateral can be decomposed into two coverings.
    0 references
    0 references
    0 references
    multiple covering
    0 references
    coverig
    0 references
    decomposability
    0 references
    wedges
    0 references
    polygon
    0 references
    0 references