Combinatorial distance geometry in normed spaces (Q2417593): Difference between revisions

The paper reviews the status of a number of famous problems for finite point sets in discrete geometry in the more general setting of normed spaces. The problems under review include variants of the Hadwiger number, the blocking number, the maximum size of equilateral sets, the number of times the minimum distance or the maximum distance may occur in a point set, unit distance problems (i.e. the chromatic number of the unit distance graph, and the maximum number of edges in unit distance graphs), Steiner trees, angular measures, few-distance sets, and thin cones. For the entire collection see [Zbl 1411.52002].