{"id":113,"date":"2022-01-31T22:29:57","date_gmt":"2022-01-31T21:29:57","guid":{"rendered":"https:\/\/project.inria.fr\/jga2022\/?page_id=113"},"modified":"2022-05-30T16:40:38","modified_gmt":"2022-05-30T14:40:38","slug":"program","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/jga2022\/program\/","title":{"rendered":"Program"},"content":{"rendered":"

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

\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
<\/td>\nMon 30\/05\/2022<\/b><\/td>\nTue 31\/05\/2022<\/b><\/td>\nWed 01\/06\/2022<\/b><\/td>\n<\/tr>\n
14:00-15:30<\/b><\/td>\nWelcome (10 min)<\/span><\/td>\nNuwan Herath<\/td>\nArnau Padrol<\/td>\n<\/tr>\n
Gabriel Peyr\u00e9
\n(14:10-15:40)<\/td>\n		Owen Rouill\u00e9<\/td>\n<\/tr>\n
Corentin Lunel<\/td>\n<\/tr>\n
15:30-16:00<\/b><\/td>\nBreak (20 min)<\/span><\/td>\nBreak (30 min)<\/span><\/td>\nBreak (30 min)<\/span><\/td>\n<\/tr>\n
16:00-16:30<\/b><\/td>\nVadim Lebovici<\/td>\nMarthe Bonamy
\n(16:00-17:30)<\/td>\n		Arash Vaezi<\/td>\n<\/tr>\n
16:30-17:00<\/b><\/td>\nFlorent Tallerie<\/td>\nMarco Caoduro<\/td>\n<\/tr>\n
17:00-17:10<\/b><\/td>\nBreak (10 min)<\/span><\/td>\nBreak (10 min)<\/span><\/td>\n<\/tr>\n
17:10-17:40<\/b><\/td>\nNiloufar Fuladi<\/td>\nBreak (10 min)<\/span><\/td>\nP\u00e9guy Kem-Meka<\/td>\n<\/tr>\n
17:40-18:10<\/b><\/td>\nDaria Pchelina<\/td>\nBusiness meeting<\/td>\nBastien Rivier<\/td>\n<\/tr>\n
18:10-18:40<\/b><\/td>\nMinh Quang Le<\/td>\nDjamel Eddine Amir<\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\nConclusion (10 min)<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

Keynote presentations<\/h3>\n

We are delighted that the following speakers will give keynote presentations at JGA 2022:<\/p>\n

Marthe Bonamy<\/strong><\/a> (LaBRI<\/a> at Universit\u00e9 de Bordeaux<\/a>) –\u00a0Around the Four Colour Theorem<\/em><\/p>\n

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.<\/p>\n

Arnau Padrol<\/strong><\/a> (Institut de Math\u00e9matiques de Jussieu<\/a> at Sorbonne Universit\u00e9<\/a>) – Counting Polytopes<\/em><\/p>\n

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.<\/p>\n

Gabriel Peyr\u00e9<\/strong><\/a> (DMA<\/a> at \u00c9cole Normale Sup\u00e9rieure<\/a>) – Scaling Optimal Transport for High Dimensional Learning<\/em><\/p>\n

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<\/a>)<\/p>\n

Short talks<\/h3>\n

Djamel Eddine Amir <\/strong>(Universit\u00e9 de Lorraine) – Computability of Finite Simplicial Complexes<\/em><\/p>\n

Marco Caoduro<\/strong> (Laboratoire G-SCOP at Universit\u00e9 Grenoble Alpes) –\u00a0On the Hitting\/Packing Ratio of Axis-Parallel Segments<\/em><\/p>\n

Niloufar Fuladi<\/strong> (Universit\u00e9 Gustave Eiffel) – Short Canonical Decomposition for Non-Orientable Surfaces<\/em><\/p>\n

Nuwan Herath<\/strong> (Inria Nancy-Grand Est) – Fast High-Resolution Drawing of Algebraic Curves<\/em><\/p>\n

P\u00e9guy Kem-Meka Tiotsop Kadzue<\/strong> (University of Ngaound\u00e9r\u00e9) – Dimensionality Reduction for Persistent Homology<\/em><\/p>\n

Vadim Lebovici<\/strong> (Universit\u00e9 Paris-Saclay, Inria, Laboratoire de math\u00e9matiques d’Orsay) – Hybrid Transforms of Constructible Functions<\/em><\/p>\n

Corentin Lunel<\/strong> (Universit\u00e9 Gustave Eiffel) – A Knot Invariant Inspired from Branchwidth and Obstructions<\/em><\/p>\n

Daria Pchelina<\/strong> (LIPN, Universit\u00e9 Sorbonne Paris Nord) – Density of Triangulated Ternary Disc Packings<\/em><\/p>\n

Minh Quang Le<\/strong> (State University of New York at Buffalo) – Persistent Homology of Convection Cycles in Network Flows<\/em><\/p>\n

Bastien Rivier<\/strong> (Universit\u00e9 Clermont-Auvergne and LIMOS) – Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings<\/em><\/p>\n

Owen Rouill\u00e9<\/strong> (Inria Sophia Antipolis – M\u00e9diterran\u00e9e) – Computing Complete Hyperbolic Structures on Cusped 3-Manifolds<\/em><\/p>\n

Florent Tallerie<\/strong> (Universit\u00e9 Grenoble Alpes) – A Universal Triangulation for Flat Tori<\/em><\/p>\n

Arash Vaezi<\/strong> (Sharif University of Technology) – Versions of the Art Gallery Problem<\/em><\/p>","protected":false},"excerpt":{"rendered":"

Each day the event begins at 14:00 in the afternoon (CEST \/ UTC+02:00). The schedule of the conference is now final: Mon 30\/05\/2022 Tue 31\/05\/2022 Wed 01\/06\/2022 14:00-15:30 Welcome (10 min) Nuwan Herath Arnau Padrol Gabriel Peyr\u00e9 (14:10-15:40) Owen Rouill\u00e9 Corentin Lunel 15:30-16:00 Break (20 min) Break (30 min) Break\u2026<\/p>\n

Continue reading<\/span><\/i><\/a> <\/p>\n","protected":false},"author":2155,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-113","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/jga2022\/wp-json\/wp\/v2\/pages\/113","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/jga2022\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.inria.fr\/jga2022\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/jga2022\/wp-json\/wp\/v2\/users\/2155"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/jga2022\/wp-json\/wp\/v2\/comments?post=113"}],"version-history":[{"count":63,"href":"https:\/\/project.inria.fr\/jga2022\/wp-json\/wp\/v2\/pages\/113\/revisions"}],"predecessor-version":[{"id":271,"href":"https:\/\/project.inria.fr\/jga2022\/wp-json\/wp\/v2\/pages\/113\/revisions\/271"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/jga2022\/wp-json\/wp\/v2\/media?parent=113"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}