ANR logo

ANR Project MIN-MAX (ANR-19-CE40-0014) - 2019-2023
Min-max constructions in geometry and topology

We are offering a one-year postdoctoral position.

Overview - Members - Publications - Seminars - Positions - Links - Contact


This collaborative research project aims to bring together researchers from various areas - namely, geometry and topology, minimal surface theory and geometric analysis, and computational geometry and algorithms - to work on a precise theme around min-max constructions and waist estimates.

These past few years, min-max techniques led to groundbreaking advances in the field of geometry, including the resolution of the Willmore conjecture and the Yau conjecture, using an approach developed by Marques and Neves. These breakthroughs combine analytical techniques from the Almgren-Pitts theory ensuring the existence of minimal hypersurfaces through min-max arguments and recent min-max estimates of Gromov and Guth based on topological considerations. Relying on different branches of geometry, analysis and topology, the resolution of these conjectures opened a new chapter of differential geometry by promoting the min-max theory and its applications, as Perelman's resolution of Poincaré's conjecture opened a new chapter with the Ricci flow.

The central theme of this proposal is to study the geometry and topology of geometrical objects through Morse theory min-max processes on the space of cycles for various functionals measuring the size of the cycles. A special focus will be given to the implementation of new geometric constructions effective enough to lead to the development of algorithms in computational geometry.

In the description of the project, we set forth three largely overlapping themes about minimal surface theory, quantitative homotopy theory, and combinatorial and non-combinatorial topology:

  1. Minimal surface theory,
    1. Index estimates, topology and classification,
    2. Discrete surfaces in 3-manifolds and applications;
  2. Quantitative homotopy theory,
    1. Sweepout estimates in Riemannian geometry,
    2. Pants decomposition,
    3. Arborescent sweepouts, embedded graphs and algorithms;
  3. Combinatorial and non-combinatorial topology,
    1. Leray's acyclic cover theorem and the Kalai-Meshulam projection theorem,
    2. From the selection lemma to waist theorems and back.