How to build a barricade

DOI10.1007/BF01637278MaRDI QIDQ795340zbMATH OpenOpenAlexFDO

Authors János Pach, Vojtěch Rödl, Peter Frankl

Publication date 1984

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/178193

zbMATH Keywords

convex setsdensest packingindependent random variables

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Geometric probability and stochastic geometry (60D05)

Review text

Given a packing \(\mathcal C=\{C_i\mid i\in I\}\) of congruent copies of a strictly convex planar set \(C\) in a parallel strip \(S\) of width \(w\) and a straight line \(\ell\), let \(| \ell \cap \mathcal C|\) denote the sum of the lengths of the segments \(\ell \cap C_i\) over all \(i\in I\). It is proved that \[ \sup_{\mathcal C}\inf_{\ell}| \ell \cap {\mathcal C}| =(\delta(C)+o(1))w, \] where \(\delta (C)\) is the density of the densest packing of congruent copies of \(C\) in the plane. Some generalizations are also considered.

Recommendations

• The densest packing of equal circles into a parallel strip
• scientific article; zbMATH DE number 4019889
• Densest packings of typical convex sets are not lattice-like
• Covering the Plane with Congruent Copies of a Convex Body
• On packings and coverings of unit density

Cites work

• scientific article; zbMATH DE number 3342541 (Why is no real title available?)
• scientific article; zbMATH DE number 3083197 (Why is no real title available?)
• Noetherian modules and Noetherian injective rings

Cited in

(1)

• A `large deviation' phenomenon in discrete geometry. I

This page was built for publication: How to build a barricade

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795340)