CMS/SMC
CanaDAM 2015
University of Saskatchewan, June 1 - 4, 2015 www.cms.math.ca//2015
Program        

Invited Minisymposia

By invitation of the Program Committee, there will be minisymposia in the following areas.

Algorithmic chemical reaction networks
Organizer and Chair: Dave Doty (California Institute of Technology, USA)

The model of chemical reaction networks (CRNs) has traditionally been used as a descriptive language for naturally occurring chemical systems. Recent advances in bioengineering have shown that it is possible to construct chemicals that behave according to any artificial CRN, showing that it makes sense to think of CRNs as a programming language that can be implemented with chemicals. This minisymposium will feature recent work on the algorithmic theory of CRNs.

Robert Brijder (Hasselt University), Anne Condon (University of British Columbia), Robert Johnson (California Institute of Technology), David Soloveichik (University of California, San Francisco), Chris Thachuk (California Institute of Technology).


At the interface of physics and combinatorics
Organizer and Chair: Karen Yeats (Simon Fraser University, Canada)

There are many instances where combinatorial techniques can be brought to bear on physics problems and conversely where physics can yield new insights into existing combinatorial problems as well as providing deep new problems to the combinatorial community. This minisymposium will investigate various aspects of the interface between physics and combinatorics and will include problems which should be more widely known.

Julien Courtiel (Simon Fraser University), Erik Panzer (Humboldt University of Berlin), Stu Whittington (University of Toronto), Karen Yeats (Simon Fraser University).


Combinatorial optimization
Organizer and Chair: Samuel Fiorini (Université libre de Bruxelles, Belgium)

Combinatorial optimization leverages mathematical insight to solve hard problems exactly or approximately, while striving for efficiency. This minisymposium will showcase recent results on problems related to, for example, cuts in graphs and covering.

Zachary Friggstad (University of Alberta), Jochen Koenemann (University of Waterloo), Kanstantsin Pashkovich (Université Libre de Bruxelles), Laura Sanità (University of Waterloo), Tamon Stephen (Simon Fraser University).


Matroid theory
Organizer and Chair: Stefan van Zwam (Louisiana State University, USA)

Matroids are combinatorial abstractions of various notions of dependence. Matroids arise from trees in graphs, path systems in digraphs, vector spaces, error-correcting codes, and more. The study of matroids makes extensive use of notions generalized from graph theory, such as minors and connectivity. This minisymposium will cover a wide range of topics in modern matroid theory.

Joseph Bonin (George Washington University), Dillon Mayhew (Victoria University of Wellington), Peter Nelson (University of Waterloo), Irene Pivotto (University of Western Australia), Stefan van Zwam (Louisiana State University).


Probabilistic combinatorics
Organizer and Chair: Amin Coja-Oghlan (Goethe University Frankfurt/Main, Germany)

In recent years, probabilistic combinatorics has been influenced by a wide variety of novel ideas, some of them emerging from the statistical physics community. This session is about probabilistic combinatorics in a broad sense, including random discrete structures, random processes on discrete structures and the probabilistic method.

Nikolaos Fountoulakis (University of Birmingham), Jan Hladky (Academy of Sciences of the Czech Republic), Mike Molloy (University of Toronto), Daniel Reichman (Cornell University), Lutz Warnke (University of Cambridge).


Random graphs
Organizer and Chair: Pawel Pralat (Ryerson University, Canada)

This minisymposium will cover areas related to the theory of random graphs that lies at the intersection between graph theory and probability theory, and studies the properties of typical graphs. This subject was 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), Andrzej Dudek (Western Michigan University), Lincoln Lu (University of South Carolina), Abbas Mehrabian (Pacific Institute for the Mathematical Sciences), Tobias Muller (Utrecht University).


Spectral methods in graph theory
Organizer and Chair: Bill Martin (Worcester Polytechnic Institute, USA) and Jason Williford (University of Wyoming, USA)

This minisymposium surveys recent developments in graph theory involving eigenvalues, eigenvectors and eigenspaces. In the study of graph symmetry, knot theory, discrete optimization and quantum information theory, spectral techniques provide powerful and sometimes surprising results that can be much harder to obtain by traditional methods. The speakers use tools from linear algebra, number theory and spherical geometry to provide new insights into graph theory and its applications.

Gabriel Coutinho (University of Waterloo), Krystal Guo (Simon Fraser University), Takuya Ikuta (Kobe Gakuin University), Andriy Prymak (University of Manitoba), Jason Williford (University of Wyoming).


Structural graph theory
Organizer and Chair: Luke Postle (University of Waterloo, Canada)

Structural graph theory is the study of graph classes and their properties involving topics as diverse as connectivity, minors, subdivisions, matchings, and colorings. The field has a rich and storied history with its various structural characterizations dating back to the times of Kuratowski and Tutte. This minisymposium will explore recent work in these areas.

Zdenek Dvorak (Charles University), Mark Ellingham (Vanderbilt University), Nishad Kothari (University of Waterloo), Chun-Hung Liu (Princeton University), Bojan Mohar (Simon Fraser University).


Topological methods in discrete mathematics
Organizer and Chair: Ron Aharoni (Technion - Israel Institute of Technology, Israel)

The minisymposium will focus on topological methods in discrete mathematics. These sometimes enable proofs of results that are not presently negotiable by other methods.

Penny Haxell (University of Waterloo), Andreas Holmsen (KAIST), Lothar Narins (Freie Universität Berlin), Matej Stehlik (Université Joseph Fourier), Shira Zerbib (Technion - Israel Institute of Technology).


Handling of online submissions has been provided by the CMS.

Event Sponsors

Atlantic Association for Research in the Mathematical Sciences Centre de recherches mathmatiques The Fields Institute Pacific Institute for the Mathematical Sciences Canadian Mathematical Society University of Saskatchewan