Lecture 1, by János Pach (Alfréd Rényi Mathematical Institute of the Hungarian Academy of Science, Budapest): Facets of Simplicity
We discuss some notoriously hard combinatorial problems for large classes of graphs and hypergraphs arising in geometric, algebraic, and practical applications. These structures are of bounded complexity: they can be embedded in a bounded-dimensional space, or have small VC-dimension, or a short algebraic description. What are the advantages of low complexity? I will suggest a few possible answers to this question, and illustrate them with classical examples.
Time & Location
May 30, 2022 | 02:15 PM