Program

Each day the event begins at 14:00 in the afternoon (CEST / UTC+02:00). The schedule of the conference is now final:

Keynote presentations

We are delighted that the following speakers will give keynote presentations at JGA 2022:

Marthe Bonamy (LaBRI at Université de Bordeaux) – Around the Four Colour Theorem

In this talk we will discuss two crucial tools towards the celebrated Four Colour Theorem: Kempe chains and the discharging method. Both these tools prove to be useful in a variety of contexts, which this talk will not be able to cover in full. Beyond the mere invitation to understand the simple ideas behind this elusive theorem, we hope it will be an entry door to possible connections and applications.

Arnau Padrol (Institut de Mathématiques de Jussieu at Sorbonne Université) – Counting Polytopes

This talk will be an introduction to the enumeration of combinatorial types of convex polytopes. While in dimensions up to 3 we have a very good understanding on the asymptotic growth of the number of polytopes with respect to the number of vertices, in higher dimensions we only have coarse estimates. Upper bounds arise from results of Milnor and Thom from real algebraic geometry, whereas lower bounds are obtained with explicit constructions. I will survey the best bounds up to date.

Gabriel Peyré (DMA at École Normale Supérieure) – Scaling Optimal Transport for High Dimensional Learning

Optimal transport (OT) has recently gained lot of interest in machine learning. It is a natural tool to compare in a geometrically faithful way probability distributions. It finds applications in both supervised learning (using geometric loss functions) and unsupervised learning (to perform generative model fitting). OT is however plagued by the curse of dimensionality, since it might require a number of samples which grows exponentially with the dimension. In this talk, I will explain how to leverage entropic regularization methods to define computationally efficient loss functions, approximating OT with a better sample complexity. More information and references can be found on the website of our book “Computational Optimal Transport” (https://optimaltransport.github.io)

Short talks

Djamel Eddine Amir (Université de Lorraine) – Computability of Finite Simplicial Complexes

Marco Caoduro (Laboratoire G-SCOP at Université Grenoble Alpes) – On the Hitting/Packing Ratio of Axis-Parallel Segments

Niloufar Fuladi (Université Gustave Eiffel) – Short Canonical Decomposition for Non-Orientable Surfaces

Nuwan Herath (Inria Nancy-Grand Est) – Fast High-Resolution Drawing of Algebraic Curves

Péguy Kem-Meka Tiotsop Kadzue (University of Ngaoundéré) – Dimensionality Reduction for Persistent Homology

Vadim Lebovici (Université Paris-Saclay, Inria, Laboratoire de mathématiques d’Orsay) – Hybrid Transforms of Constructible Functions

Corentin Lunel (Université Gustave Eiffel) – A Knot Invariant Inspired from Branchwidth and Obstructions

Daria Pchelina (LIPN, Université Sorbonne Paris Nord) – Density of Triangulated Ternary Disc Packings

Minh Quang Le (State University of New York at Buffalo) – Persistent Homology of Convection Cycles in Network Flows

Bastien Rivier (Université Clermont-Auvergne and LIMOS) – Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings

Owen Rouillé (Inria Sophia Antipolis – Méditerranée) – Computing Complete Hyperbolic Structures on Cusped 3-Manifolds

Florent Tallerie (Université Grenoble Alpes) – A Universal Triangulation for Flat Tori

Arash Vaezi (Sharif University of Technology) – Versions of the Art Gallery Problem