Mini-courses

Alheydis Geiger - Matroids

Abstract: We will start with a refresh of the topic for all who are acquainted with matroids and a fast lane introductory course for all newbies. During the remaining lectures we will meet oriented matroids, consider realizability of matroids and learn about Mnëv’s universality theorem.

Leonid Monin - Combinatorics of Chow quotients

Abstract: When a group acts on an algebraic variety, the naive topological quotient typically fails to be an algebraic variety and lacks good geometric or combinatorial properties. Defining a quotient construction that produces a meaningful algebraic variety is therefore a subtle problem. One solution is the Chow quotient, introduced by Kapranov. Many important algebraic varieties arise in this way, including the spaces of complete quadrics and complete collineations, the moduli space of marked stable rational curves, wonderful compactifications of hyperplane arrangements, and several others.

In this lecture series, I will explore the combinatorial aspects of Chow quotients, focusing on the case of quotients by an algebraic torus. After a brief geometric motivation, we will examine toric examples, where Chow quotients correspond to the operation of taking a fibre polytope. I will then specialise to the case of a one-dimensional torus C*, giving a combinatorial description of the Chow quotient as the variety of monotone chains of orbits. Throughout the lectures, I will illustrate these ideas with many explicit examples and computations, including applications to wonderful models for linear spaces of matrices.

Martin Winter - The Geometry and Combinatorics of Rigidity

Abstract: This course will give an introduction to modern rigidity theory. Rigidity theory studies realization spaces of discrete geometric objects, such as frameworks, polytopes and matroids. The subject is classically motivated from physics and engineering contexts, but has since developed its own intrinsic mathematical appeal. The archetypical question is whether a given geometric object admits a continuous deformation (a flex) that preserves its combinatorial structure together with certain metric measurements, e.g. lengths, co-planarities or angles. At its core, this amounts to a local and global study of real algebraic sets. These objects can be universally complicated, and rigidity theory needed to develop several paradigms to deal with this apparent intractability. Today, the theory draws from a broad spectrum of mathematical ideas, such as from computational algebraic geometry, polynomial optimization, convex geometry, tropical geometry, and spectral graph theory.

This course will start out with a general introduction to the foundations of rigidity theory and present the paradigms of first-order theory and generic rigidity. The course will continue with a selection of modern combinatorial and geometric topics close to current research. It will address notions of rigidity that arise in the study of polytopes and matroids.