We show that the k-point bound of de Laat, Machado, Oliveira, and Vallentin, a hierarchy of upper bounds for the independence number of a topological packing graph derived from the Lasserre hierarchy, converges to the independence number.

Preprint

Optimization hierarchies for distance-avoiding sets in compact spaces

Bram Bekker, Olga Kuryatnikova, Fernando Mário Olivera Filho, and Juan C. Vera

Witsenhausen’s problem asks for the maximum fraction αn of the n-dimensional unit sphere that can be covered by a measurable set containing no pairs of orthogonal points. The best upper bounds for αn are given by extensions of the Lovász theta number. In this paper, optimization hierarchies based on the Lovász theta number, like the Lasserre hierarchy, are extended to Witsenhausen’s problem and similar problems. These hierarchies are shown to converge and are used to compute the best upper bounds for αn in low dimensions.

Buildings are beautiful mathematical objects tying a variety of subjects in algebra and geometry together in a very direct sense. They form a natural bridge to visualizing more complex principles in group theory. As such, they provide an opportunity to talk about the inner workings of mathematics to a broader audience, but the visualizations could also serve as a didactic tool in teaching group and building theory, and we believe they can even inspire future research. We present an algorithmic method to visualize these geometric objects. The main accomplishment is the use of existing theory to produce three-dimensional, interactive models of buildings associated with groups with a BN-pair. The final product, an interactive web application called The Buildings Gallery, can be found at https://buildings.gallery/ [Bekker, B. (2021, June). The Buildings Gallery].