CanaDAM 2021
En ligne, 25 - 28 mai 2021 canadam.math.ca/2021f
       

Minisymposia invités

À l'invitation du comité de programme, des minisymposia sont prévues dans les domaines ci-dessous.

Approximation Algorithms
Org: Chaitanya Swamy (University of Waterloo)

Deeparnab Chakrabarty (Dartmouth College), Chandra Chekuri (University of Illinois, Urbana-Champaign), Anupam Gupta (Carnegie Mellon University), Aleksandar Nikolov (University of Toronto), Ola Svensson (Ecole Polytechnique Fédérale de Lausanne).


Combinatorial Optimization - Part I
Org: László Végh (London School of Economics)

Christoph Hunkenschröder (TU Berlin), Edin Husić (London School of Economics), Jason Li (Carnegie Mellon University), Kent Quanrud (Purdue University), Sahil Singla (Princeton University and Institute for Advanced Study).


Combinatorial Optimization - Part II
Org: László Végh (London School of Economics)

Sami Davies (University of Washington), Sharat Ibrahimpur (University of Waterloo), Nathan Klein (University of Washington), Zhuan Khye Koh (London School of Economics), Vera Traub (ETH Zurich).


Combinatorics on Posets - Part I
Org: Tom Trotter (Georgia Institute of Technology)

Bartłomiej Bosek (Jagellonian University), Patrice Ossona de Mendez (CNRS, École des Hautes Études en Sciences Sociales), Jarosław Grytczuk (Technical University of Warsaw), Gwenaël Joret (Université Libre de Bruxelles), Piotr Micek (Jagellonian University).


Combinatorics on Posets - Part II
Org: Tom Trotter (Georgia Institute of Technology)

Łukasz Bożyk (University of Warsaw), Michał Seweryn (Jagellonian University), Torsten Ueckerdt (Karlsruhe Institute of Technology), Marcin Witkowski (Adam Mickiewicz University).


Discrete and algorithmic mathematics in biology and epidemiology - Part I
Org: Pengyu Liu (Simon Fraser University)

Xingru Chen (Dartmouth College), Baptiste Elie (MIVGEC, Université Montpellier), Wasiur KhudaBukhsh (Ohio State University), Joel Miller (La Trobe University).


Discrete and algorithmic mathematics in biology and epidemiology - Part II
Org: Pengyu Liu (Simon Fraser University)

Julia Palacios (Stanford University), Christoph Weitkamp (Universität Göttingen), Jianrong Yang (Sun Yat-sen University), Louxin Zhang (National University of Singapore).


Discrete Geometry
Org: Yufei Zhao (MIT)

Dor Minzer (Massachusetts Institute of Technology), Cosmin Pohoata (Yale University), Alexandr Polyanskii (Moscow Institute of Physics and Technology), Yair Shenfeld (Massachusetts Institute of Technology), Josh Zahl (University of British Columbia).


Extremal Combinatorics
Org: Natasha Morrison (University of Victoria)

Marcelo Campos (Instituto de Matemática Pura e Aplicada), Shoham Letzter (University College London), Rob Morris (Instituto de Matemática Pura e Aplicada), Wojciech Samotij (Tel Aviv University), Katherine Staden (University of Oxford).


Generating series and confined lattice walks - Part I
Org: Thomas Dreyfus (CNRS, Université de Strasbourg) et Andrew Elvey Price (CNRS, Université de Tours)

Lucia Di Vizio (CNRS, Université de Versailles-St Quentin), Helen Jenne (Université de Tours and Université d'Orléans), Michael Singer (North Carolina State University), Michael Wallner (TU Wien).


Generating series and confined lattice walks - Part II
Org: Thomas Dreyfus (CNRS, Université de Strasbourg) et Andrew Elvey Price (CNRS, Université de Tours)

Alin Bostan (INRIA Saclay Île-de-France), Manuel Kauers (Johannes Kepler Universität), Irène Markovici (Université de Lorraine), Marni Mishna (Simon Fraser University).


In honour of Pavol Hell - Part I
Org: Gary MacGillivray (University of Victoria)

Kathie Cameron (Wilfred Laurier University), Shenwei Huang (Nankai University), Jaroslav Nešetřil (Charles University), Arash Rafiey (Indiana State University), Xuding Zhu (Zhejiang Normal University).


In honour of Pavol Hell - Part II
Org: Gena Hahn (Université de Montréal) et Gary MacGillivray (University of Victoria)

Richard Brewster (Thompson Rivers University), Cesar Hernandez-Cruz (Universidad Nacional Autónoma de México), Jing Huang (University of Victoria), David Kirkpatrick (UBC), Gary MacGillivray (University of Victoria).


Invitation to distributed graph algorithms
Org: Jara Uitto (Aalto University)

Soheil Behnezhad (University of Maryland), Sebastian Brandt (ETH Zurich), Seri Khoury (Simons Institute, UC Berkeley), Huang Lingxiao (Institute for Interdisciplinary Information Sciences), Yannic Maus (Technion, Israel Institute of Technology).


Invitation to Reconfiguration - Part I
Org: Nicolas Bousquet (CNRS, Université de Lyon) et Anna Lubiw (University of Waterloo)

“Reconfiguration” is about changing one configuration to another via discrete steps, for example sorting a list by swapping pairs of adjacent elements, or changing one proper colouring of a graph to another by recolouring one vertex at a time. We may ask: Is there a reconfiguration path between any two configurations? How short a path? How efficiently can it be found? How many reconfiguration steps to a random configuration? These questions arise in various fields such as discrete geometry (flip distance), combinatorics (graph recoloring, token swapping), bio-informatics (phylogenetics), combinatorial game theory (puzzles), random sampling (Monte Carlo Markov chains), and combinatorial optimization (Hirsch’s conjecture). The talks in this minisymposium give a sample of recent results in these areas.

Jean Cardinal (Université Libre de Bruxelles), Colin R Defant & Noah Kravitz (Princeton University), Erik Demaine & Nicole Wein (MIT & University of Waterloo), Linda Kleist (Technische Universität Braunschweig), Emo Welzl (ETH Zurich).


Invitation to Reconfiguration - Part II
Org: Nicolas Bousquet (CNRS, Université de Lyon) et Anna Lubiw (University of Waterloo)

“Reconfiguration” is about changing one configuration to another via discrete steps, for example sorting a list by swapping pairs of adjacent elements, or changing one proper colouring of a graph to another by recolouring one vertex at a time. We may ask: Is there a reconfiguration path between any two configurations? How short a path? How efficiently can it be found? How many reconfiguration steps to a random configuration? These questions arise in various fields such as discrete geometry (flip distance), combinatorics (graph recoloring, token swapping), bio-informatics (phylogenetics), combinatorial game theory (puzzles), random sampling (Monte Carlo Markov chains), and combinatorial optimization (Hirsch’s conjecture). The talks in this minisymposium give a sample of recent results in these areas.

Daniel Cranston (Virginia Commonwealth University), Satyan Devadoss (University of San Diego), Marc Heinrich (University of Leeds), Kuikui Liu (University of Washington), Jonathan Narboni (Université de Bordeaux).


Invitation to Sparsity
Org: Zdeněk Dvořák (Charles University)

Patrice Ossona de Mendez (CNRS, École des Hautes Études en Sciences Sociales), Zdeněk Dvořák (Charles University), Michał Pilipczuk (University of Warsaw), Felix Reidl (Birkbeck University of London), Sebastian Siebertz (University of Bremen).


Probabilistic Approaches
Org: Jozef Skokan (London School of Economics)

Annika Heckel (Ludwig-Maximilians-Universität München), Matthew Jenssen (University of Birmingham), Jinyoung Park (Institute for Advanced Study), Will Perkins (University of Illinois at Chicago), Mehtaab Sawhney (Massachusetts Institute of Technology).


Structural Graph Theory
Org: Sergey Norin (McGill University)

Édouard Bonnet (CNRS, ÉNS Lyon), Chun-Hung Liu (Texas A&M University), Rose McCarty (University of Waterloo), Richard Montgomery (University of Birmingham), Sophie Spirkl (University of Waterloo).


Handling of online submissions has been provided by the CMS.