 |
|
||||
Invited Minisymposia
By invitation of the Meeting Committee, there will be minisymposia in the following areas.
Algebraic Combinatorics
Organizer and Chair: Steph Van Willigenburg (University of British Columbia)
Algebraic combinatorics is a vibrant area whose results and tools in both algebra and combinatorics impact other areas such as representation theory, algebraic geometry and quantum physics. This minisymposium will showcase a variety of the latest results and applications.
Drew Armstrong (University of Miami), Abraham Broer (Université de Montréal), Rosa Orellana (Dartmouth), Brendon Rhoades (UCSD), Hugh Thomas (University of New Brunswick).
Algorithmic Methods in Comparative Genomics
Organizer and Chair: Max Alekseyev (University of South Carolina)
Comparative genomics studies similarities and differences in genome structure and function across different species to yield insights into evolution. Comparative genomics heavily relies on computation to process the huge amount of information contained in genomic data. This minisymposium features talks on algorithmic methods in comparative genomics from experts in the field.
Max Alekseyev (University of South Carolina), Bahar Behsaz (Simon Fraser University), Patricia Evans (University of New Brunswick), David Sankoff (University of Ottawa), Jijun Tang (University of South Carolina).
Analytic Combinatorics
Organizer and Chair: Alfredo Viola (Universidad de la República, Uruguay)
As defined in the book ``Analytic Combinatorics'' by Philippe Flajolet and Robert Sedgewick (2009): "Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology and information theory". This minisymposium aims at presenting new results and applications in the area.
Julien Clement (GREYC, CNRS), Daniele Gardy (Université de Versailles Saint-Quentin), Marcos Kiwi (Universidad de Chile), Alois Panholzer (Technische Universität Wien), Brigitte Vallee (GREYC, CNRS).
Combinatorics and Geometry of Linear Optimization
Organizer and Chair: Antoine Deza (McMaster University)
Optimization has long been a source of inspiration and applications for geometers, and similarly, discrete and convex geometry have provided foundations for many efficient optimization techniques. Combinatorics forms an intrinsic part of optimization, and there is a rich interplay between geometry and combinatorics. The intent of the minisymposium is to bring together geometers and combinatorial and continuous optimizers.
Antoine Deza (McMaster University), Nathan Krislock (University of Britsih Columbia), Frauke Liers (Universität Erlangen-Nürnberg), Manuel Vieira (Universidade Nova Lisboa), Henry Wolkowicz (University of Waterloo).
Design Theory
Organizer and Chair: Ian Wanless (Monash University)
This minisymposium will cover the existence, enumeration and properties of combinatorial designs such as Latin squares, Steiner triple systems, Hadamard matrices and so on. Such designs are widely used in statistical analysis, communication technologies and scheduling problems, to name just a few areas.
Daniel Horsley (Monash University), Hadi Kharaghani (University of Lethbridge), Joy Morris (University of Lethbridge), David Pike (Memorial University of Newfoundland), Doug Stones (Dalhousie University).
Enumerative Combinatorics
Organizer and Chair: Marni Mishna (Simon Fraser University)
Developments in enumerative combinatorics clarify connections between classes and can help us understand the large scale behaviour. This session explores recent work of both theoretical and applied interest, with an emphasis on bijective connections, and asymptotic enumeration.
Mathilde Bouvel (CNRS/LaBRI Bordeaux I), Sergi Elizalde (Dartmouth College), Alejandro Morales (LaCIM, UQAM), Markus Nebel (University of Kaiserslautern), Bruce Sagan (Michigan State University).
Extremal Combinatorics
Organizer and Chair: Dhruv Mubayi (University of Illinois at Chicago)
Extremal combinatorics studies the extreme value of some parameter over a class of combinatorial objects. This minisymposium will cover extremal graph and hypergraph theory, a subject that began with Turans theorem from graph theory over 70 years ago. Modern extremal combinatorics showcases tools from diverse areas including algebra, probability, number theory, analysis, and also has applications in these areas.
Penny Haxell (University of Waterloo), John Lenz (University of Illinois at Chicago), Sergey Norin (McGill University), Mathias Schacht (Universität Hamburg), Jacques Verstraete (UCSD).
Graph Theory
Organizer and Chair: Matthias Kriesell (Universität Hamburg)
Johannes Carmesin (Universität Hamburg), Bojan Mohar (Simon Fraser University/University of Ljubljana), Jonathan Noel (McGill University), Robert Šámal (Charles University), Gábor Simonyi (Hungarian Academy of Sciences).
Probabilistic Combinatorics
Organizer and Chair: Mike Molloy (University of Toronto)
This minisymposium will cover areas related to random graphs and the probabilistic method. These subjects were pioneered by Erdos and Renyi more than 50 years ago. By now, they have a major impact throughout combinatorics as well as in other fields such as physics and computer science.
Tom Bohman (Carnegie Mellon University), Amin Coja-Oghlan (Goethe University Frankfurt/Main), David Galvin (University of Notre Dame), Mike Molloy (University of Toronto), Bruce Reed (McGill University).
Handling of online submissions has been provided by the CMS.
