Oberwolfach Reports

Full-Text PDF (714 KB) | Introduction as PDF | Metadata | Table of Contents | OWR summary
Volume 5, Issue 4, 2008, pp. 2477–2556
DOI: 10.4171/OWR/2008/44

Discrete Geometry

Martin Henk[1], Jiří Matoušek and Emo Welzl[2]

(1) Institut für Mathematik, Sekretariat MA 4-1, Technische Universität Berlin, Strasse des 17. Juni 137, 10623, BERLIN, GERMANY
(2) Institut für Theoretische Informatik, ETH Zentrum, Haldeneggsteig 4 / Weinbergstrasse, CH-8092, ZÜRICH, SWITZERLAND

Discrete Geometry deals with the structure and complexity of discrete geometric objects ranging from finite point sets in the plane to more complex structures like arrangements of n-dimensional convex bodies. Classical problems such as Kepler's conjecture and Hilbert's third problem on decomposing polyhedra, as well as classical works by mathematicians such as Minkowski, Steinitz, Hadwiger and Erdös are part of the heritage of this area. By its nature, this area is interdisciplinary and has relations to many other vital mathematical fields, such as algebraic geometry, topology, combinatorics, computational geometry, convexity, and probability theory. At the same time it is on the cutting edge of applications such as geographic information systems, mathematical programming, coding theory, solid modelling, computational structural biology and crystallography.

The workshop was attended by 40 participants. There was a series of 12 survey talks giving an overview of developments in Discrete Geometry and related fields:

  • Keith Ball: A sharp discrete geometric version of Vaaler's Theorem
  • Marcus Schaefer: Hanani–Tutte and related results
  • Frank Vallentin: Fourier analysis, linear programming and distance avoiding sets in ℝn
  • Nathan Linial: What is high-dimensional combinatorics?
  • Gábor Tardos: Conflict free coloring of rectangles
  • Matthias Beck: Recent results on Ehrhart series of lattice polytopes
  • Assaf Naor: Embeddings of discrete groups and the speed of random walks
  • János Pach: Beyond planarity — Geometric intersection patterns
  • Günter M. Ziegler: On the number of simplicial 4-polytopes and 3-spheres with N facets
  • Alex Iosevich: Discrete geometry and Fourier analysis in discrete, continuous and finite field settings
  • Alexander Barvinok: Random matrices with prescribed row and column sums
  • Jesús De Loera: How to integrate a polynomial over a polytope

In addition, there were 18 shorter talks and an open problem session chaired by János Pach on Wednesday evening — a collection of open problems resulting from this session can be found in this report. The program left ample time for research and discussions in the stimulating atmosphere of the Oberwolfach Institute.

No keywords available for this article.

Henk Martin, Matoušek Jiří, Welzl Emo: Discrete Geometry. Oberwolfach Rep. 5 (2008), 2477-2556. doi: 10.4171/OWR/2008/44