Covering the d-dimensional unit cube by n rectangular boxes of smaller diameter

zbMATH Open1232.52013MaRDI QIDQ3171657FDOQ3171657

Authors I. Talata 

Publication date 5 October 2011

zbMATH Keywords

distancediametertilingcuberectangular boxextremal covering and packing

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Covering the unit cube by rectangular boxes
• Covering a unit hypercube with hypercubes.
• Covering the 3-dimensional unit cube by six rectangular boxes
• A sufficient condition for the covering of the unit cube by homothetic copies in the \(n\)-dimensional Euclidean space
• Covering boxes by points

Cited In (13)

• Cubes and Boxes Have Rupert’s Passages in Every Nontrivial Direction
• Covering of the unit square by 6 rectangles
• Covering boxes by points
• New bounds on the minimal dispersion
• On the number of points at distance at least 1 in the unit four-dimensional cube
• A sufficient condition for the covering of the unit cube by homothetic copies in the \(n\)-dimensional Euclidean space
• On distance sets of large sets of integer points
• Covering the unit cube by rectangular boxes
• Covering the 3-dimensional unit cube by six rectangular boxes
• Construction of minimal bracketing covers for rectangles
• Covering a unit hypercube with hypercubes.
• On the maximum number of points at least one unit away from each other in the unit \(n\)-cube
• Intersection of parallelepipeds in \(\mathbb R^d\)

This page was built for publication: Covering the \(d\)-dimensional unit cube by \(n\) rectangular boxes of smaller diameter

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