CanaDAM 2015
University of Saskatchewan, June 1 - 4, 2015

Schedule - Invited Minisymposia

Please note that schedules are subject to change without notice, particularly changes within a given session.

Algorithmic chemical reaction networks (IM2)
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.
Wednesday June 3
15:30 - 15:55 Robert Brijder (Hasselt University), Determining final outputs of CRNs efficiently, ARTS 134
16:00 - 16:25 Robert Johnson (California Institute of Technology), Using Bisimulation for Verification of Chemical Reaction Network Implementations, ARTS 134
16:30 - 16:55 David Soloveichik (University of California, San Francisco), Speed faults in computation by chemical reaction networks, ARTS 134
17:00 - 17:25 Chris Thachuk (California Institute of Technology), Logically reversible chemical reaction networks, ARTS 134
17:30 - 17:55 Anne Condon (University of British Columbia), CRN Pseudocode as a tool for writing deterministic, reversible CRNs, ARTS 134
At the interface of physics and combinatorics (IM4)
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.
Monday June 1
15:30 - 15:55 Erik Panzer (Humboldt University of Berlin), Linearly reducible Feynman graphs, ARTS 134
16:00 - 16:25 Stu Whittington (University of Toronto), Self-avoiding walks and polymer adsorption, ARTS 134
17:00 - 17:25 Karen Yeats (Simon Fraser University), The renormalization group equation viewed combinatorially, ARTS 134
17:30 - 17:55 Julien Courtiel (Simon Fraser University), Enumeration of planar maps with additional structures, ARTS 134
Combinatorial optimization (IM3)
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.
Tuesday June 2
10:20 - 10:45 Tamon Stephen (Simon Fraser University), The circuit diameter of the Klee-Walkup polyhedron, ARTS 134
10:50 - 11:15 Kanstantsin Pashkovich (Université Libre de Bruxelles), Cut Dominant and Forbidden Minors, ARTS 134
11:20 - 11:45 Laura Sanità (University of Waterloo), Improved Region Growing and Combinatorial Algorithms for k-Route Cut Problems, ARTS 134
11:50 - 12:15 Zachary Friggstad (University of Alberta), Local-Search Based Approximation Algorithms for Mobile Facility Location Problems, ARTS 134
12:20 - 12:45 Jochen Koenemann (University of Waterloo), Finding Small Stabilizers for Unstable Graphs, ARTS 134
Matroid theory (IM8)
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.
Thursday June 4
10:20 - 10:45 Dillon Mayhew (Victoria University of Wellington), Fans and fragile matroids, ARTS 134
10:50 - 11:15 Irene Pivotto (University of Western Australia), A first step in decomposing near-regular matroids, ARTS 134
11:20 - 11:45 Peter Nelson (University of Waterloo), Matroids denser than a projective geometry, ARTS 134
11:50 - 12:15 Stefan van Zwam (Louisiana State University), Minor-closed classes have no asymptotically good codes, ARTS 134
12:20 - 12:45 Joseph Bonin (George Washington University), Excluded Minors for (Strongly) Base-Orderable Matroids, ARTS 134
Probabilistic combinatorics (IM6)
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.
Wednesday June 3
15:30 - 15:55 Jan Hladky (Academy of Sciences of the Czech Republic), Tree packings and graceful tree labelings via semirandom method, ARTS 133
16:00 - 16:25 Mike Molloy (University of Toronto), Solution clusters for locked constraint satisfaction problems, ARTS 133
16:30 - 16:55 Daniel Reichman (Cornell University), Contagious sets in pseudorandom and random graphs, ARTS 133
17:00 - 17:25 Lutz Warnke (University of Cambridge), The phase transition in Achlioptas processes, ARTS 133
17:30 - 17:55 Nikolaos Fountoulakis (University of Birmingham), Random graphs on the hyperbolic plane, ARTS 133
Random graphs (IM9)
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.
Thursday June 4
15:30 - 15:55 Andrzej Dudek (Western Michigan University), On Hamilton Cycles in Random Hypergraphs, ARTS 134
16:00 - 16:25 Tobias Muller (Utrecht University), Connectivity and the largest component in a hyperbolic model for complex networks, ARTS 134
16:30 - 16:55 Tom Bohman (Carnegie Mellon University), Dynamic concentration in random greedy processes, ARTS 134
17:00 - 17:25 Abbas Mehrabian (Pacific Institute for the Mathematical Sciences), Why complex networks have logarithmic diameters?, ARTS 134
17:30 - 17:55 Lincoln Lu (University of South Carolina), Subgraphs in Random Non-uniform Hypergraphs, ARTS 134
Spectral methods in graph theory (IM5)
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.
Wednesday June 3
10:20 - 10:45 Jason Williford (University of Wyoming), The Maslov Index, Two-Graphs and Cometric Association Schemes, ARTS 134
10:50 - 11:15 Krystal Guo (Simon Fraser University), Eigenvalue interlacing in digraphs, ARTS 134
11:20 - 11:45 Gabriel Coutinho (University of Waterloo), Graph spectra and quantum walks, ARTS 134
11:50 - 12:15 Andriy Prymak (University of Manitoba), Non-existence of (76,30,8,14) strongly regular graph and some structural tools, ARTS 134
12:20 - 12:45 Takuya Ikuta (Kobe Gakuin University), Complex Hadamard matrices attached to some association schemes., ARTS 134
Structural graph theory (IM1)
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.
Monday June 1
10:20 - 10:45 Nishad Kothari (University of Waterloo), Generating near-bipartite bricks, ARTS 134
10:50 - 11:15 Chun-Hung Liu (Princeton University), Erdos-Posa property for topological minors, ARTS 134
11:20 - 11:45 Bojan Mohar (Simon Fraser University), On a problem of Erdos and Neumann-Lara, ARTS 134
11:50 - 12:15 Mark Ellingham (Vanderbilt University), Excluding small minors of connectivity 2, ARTS 134
12:20 - 12:45 Zdenek Dvorak (Charles University), Structure of graphs with forbidden strong immersion, ARTS 134
Topological methods in discrete mathematics (IM7)
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.
Tuesday June 2
15:30 - 15:55 Penny Haxell (University of Waterloo), Tripartite hypergraphs and connectedness, ARTS 134
16:00 - 16:25 Shira Zerbib (Technion - Israel Institute of Technology), Matchings and covers of (weighted) d-intervals, ARTS 134
16:30 - 16:55 Matej Stehlik (Université Joseph Fourier), A graph colouring version of the Borsuk–Ulam theorem, ARTS 134
17:00 - 17:25 Lothar Narins (Freie Universität Berlin), Extremal Hypergraphs for Ryser's Conjecture, ARTS 134
17:30 - 17:55 Andreas Holmsen (KAIST), The geometric join and the general position complex, ARTS 134

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