Minimal translation covers for sets of diameter 1 (Q1375065): Difference between revisions

Let \(K_1^d\) be the family of all sets of diameter \(\leq1\) in \(E^d\). A set \(C\subset E^d\) is said to be a translation cover for \(K_1^d\) if each member of \(K_1^d\) lies in some translate of \(C\). Helly's theorem implies that \(C\subset E^d\) is a translation cover of \(K_1^d\) iff any set of \(d+1\) points having diameter 1 in \(E^d\) is a subset of some translate of \(C\). For \(d=2\), this and Cauchy's area formula (according to which the perimeter of \(K\) equals \(\pi\cdot w(K)\), with \(w(K)\) as mean width) imply that the smallest perimeter convex domain which is a translation cover for \(K_1^d\) is the circle of diameter \(\frac2{\sqrt3}\). The authors prove this statement with the help of proper Fourier expansion of the support function.