On illumination number of bodies of constant width

Borsuk’s number b(n) is the smallest integer such that any set of diameter 1 in the n-dimensional space can be covered by b(n) sets of a smaller diameter. Exponential upper bounds on b(n) were first obtained by Shramm (1988) and later by Bourgain and Lindenstrauss (1989).

To obtain an upper bound on b(n), Bourgain and Lindenstrauss provided exponential bounds (both upper and lower) in Grünbaum's problem – the problem of determining the minimal number of open balls of diameter 1 needed to cover a set of diameter 1. On the other hand, Schramm provided an exponential upper bound on the illumination number of n-dimensional bodies of constant width. In 2015 Kalai asked if there exist n-dimensional convex bodies of constant width with illumination number exponentially large in n.

In this talk I will answer Kalai’s question in the affirmative and provide a new lower bound in the Grünbaum’s problem. This talk is based on a joint work with Andriy Bondarenko and Andriy Prymak.