Packing convex bodies by cylinders (Q282761): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1507.05115 / rank
 
Normal rank

Revision as of 12:02, 18 April 2024

scientific article
Language Label Description Also known as
English
Packing convex bodies by cylinders
scientific article

    Statements

    Packing convex bodies by cylinders (English)
    0 references
    0 references
    0 references
    12 May 2016
    0 references
    In the paper under review, the authors continue their work in relation to \textit{T. Bang}'s plank problem [Proc. Am. Math. Soc. 2, 990--993 (1951; Zbl 0044.37802)]. The problem asks whether the sum of the base areas of finitely many cylinders covering a \(3\)-dimensional convex body is at least half of the minimum area of a \(2\)-dimensional projection of the body. In [the authors, J. Geom. Anal. 19, No. 2, 233--243 (2009; Zbl 1175.52008)] this problem was investigated in the \(d\)-dimensional setting. In particular, Bang's conjecture was proved with constant one third instead of one half. In the present paper, several strong results on the packing counterpart of the above problems are given. The authors also extend their bounds to the case of \(r\)-fold coverings and packings and obtain a packing analog of \textit{K. J. Falconer}'s results [Math. Proc. Camb. Philos. Soc. 87, 81--96 (1980; Zbl 0424.28002)].
    0 references
    convex body
    0 references
    Banach-Mazur distance
    0 references
    Bang's problem
    0 references
    volume ratio
    0 references
    packing by cylinders
    0 references
    covering by cylinders
    0 references
    non-separable arrangement
    0 references
    NS-domain
    0 references
    NS-family
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references