Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-11T02:59:13.890Z Has data issue: false hasContentIssue false

The longest segment in the complement of a packing

Published online by Cambridge University Press:  26 February 2010

K. Böröczky Jr
Affiliation:
Rényi Institute of Mathematics, Budapest, P.O. Box 127, 1364 Hungary
G. Tardos
Affiliation:
Rényi Institute of Mathematics, Budapest, P.O. Box 127, 1364 Hungary
Get access

Extract

Let K be a compact convex body in ℝn not contained in a hyperplane, and denote the norm whose unit ball is ½(K − K) by ║·║k. Given a translative packing of K, we are interested in how long a segment (with respect to ║·║K) can lie in the complement of the interiors of the translates. The main result of this note is to show the existence of a translative packing such that the length of the longest segments avoiding it is only exponential in the dimension n (see below). We start here with a lower bound, showing that this bound is close to optimal for balls.

Information

Type
Research Article
Copyright
Copyright © University College London 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable