Minimal 2-fold coverings of E^ d

DOI10.1023/A:1004985022580MaRDI QIDQ1360281zbMATH OpenOpenAlexFDO

Authors David Nadler

Publication date 27 August 1997

Published in Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1004985022580

zbMATH Keywords

Gale transformsHelly's theoremopen halfspaces

Mathematics Subject Classification ID

Helly-type theorems and geometric transversal theory (52A35) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Review text

Let \(N(k,d)\) be the smallest positive integer \(N\) such that given any collection of open halfspaces which \(k\)-fold covers \(E^d\), there exists a subcollection of cardinality at most \(N\) which also \(k\)-fold covers \(E^d\). The author proves the inequality \[ N(k,d)\leq N(k-1,d) + d{N(k-1,d)\choose{k-1}} \] which shows that \(N(k,d)\) is well defined as a finite number. It is not difficult to show that \(N(1,d) = d+1\), and the main result of the paper is the equality \(N(2,d) = \lfloor ((d+3)/2)^2 \rfloor\).

Recommendations

• Covering the plane with convex polygons
• \((n,m)\)-fold covers of spheres
• scientific article; zbMATH DE number 739040
• Covering boxes by points

Cited in

(2)

• Eckhoff's problem on convex sets in the plane
• scientific article; zbMATH DE number 739040 (Why is no real title available?)

This page was built for publication: Minimal 2-fold coverings of \({\mathbf E}^ d\)

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