Algebraic Combinatorics (IM2)  |
| 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. |
| |
| Monday June 10 |
| 15:15 - 15:40 | Drew Armstrong (University of Miami), Maximal Chains of Parabolic Subgroups, Arts A-1043 |
| 15:45 - 16:10 | Brendon Rhoades (UCSD), Extending the parking space, Arts A-1043 |
| 16:15 - 16:40 | Rosa Orellana (Dartmouth), The quasi-partition algebra, Arts A-1043 |
| 16:45 - 17:10 | Hugh Thomas (University of New Brunswick), A reflection group perspective on c-vectors, Arts A-1043 |
| 17:15 - 17:40 | Abraham Broer (Université de Montréal), Algorithms of making linebundles on cotangent bundles of complete homogeneous spaces more positive., Arts A-1043 |
| |
| Algorithmic Methods in Comparative Genomics (IM6) |
| 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. |
| |
| Wednesday June 12 |
| 15:15 - 15:40 | Bahar Behsaz (Simon Fraser University), Turing Universality of DNA Self-Assembly Models at Temperature 1, Arts A-1043 |
| 15:45 - 16:10 | Patricia Evans (University of New Brunswick), Finding RNA structure motifs, Arts A-1043 |
| 16:15 - 16:40 | David Sankoff (University of Ottawa), Fractionation, rearrangement, consolidation and reconstruction, Arts A-1043 |
| 16:45 - 17:10 | Jijun Tang (University of South Carolina), Binary Encoding and Genome Rearrangement Analysis, Arts A-1043 |
| 17:15 - 17:40 | Max Alekseyev (University of South Carolina), Genome rearrangements: when intuition fails, Arts A-1043 |
| |
| Analytic Combinatorics (IM3) |
| 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. |
| |
| Tuesday June 11 |
| 10:10 - 10:35 | Marcos Kiwi (Universidad de Chile), Towards the distribution of the size of the largest non-crossing matchings in random bipartite graphs, Arts A-1043 |
| 10:40 - 11:05 | Daniele Gardy (Université de Versailles Saint-Quentin), Some problems related to the enumeration of lambda-terms, Arts A-1043 |
| 11:10 - 11:35 | Julien Clement (GREYC, CNRS), A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms, Arts A-1043 |
| 11:40 - 12:05 | Brigitte Vallee (GREYC, CNRS), Typical depth of a digital search tree built on a general source, Arts A-1043 |
| 12:10 - 12:35 | Alois Panholzer (Technische Universität Wien), Occurrences of exactly solvable PDEs in combinatorial problems, Arts A-1043 |
| |
| Combinatorics and Geometry of Linear Optimization (IM4) |
| 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. |
| |
| Tuesday June 11 |
| 15:15 - 15:40 | Henry Wolkowicz (University of Waterloo), Taking advantage of Degeneracy and Special Structure in Linear Cone Optimization, Arts A-1043 |
| 15:45 - 16:10 | Nathan Krislock (University of Britsih Columbia), BiqCrunch: a semidefinite-based solver for binary quadratic problems, Arts A-1043 |
| 16:15 - 16:40 | Frauke Liers (Universität Erlangen-Nürnberg), Geometry of Network Design with Certain and Uncertain Demands, Arts A-1043 |
| 16:45 - 17:10 | Manuel Vieira (Universidade Nova Lisboa), Extracting information of unsatisfiable formulas using Semidefinite certificates of infeasibility, Arts A-1043 |
| 17:15 - 17:40 | Antoine Deza (McMaster University), Combinatorial, computational, and geometric approaches to the colourful simplicial depth, Arts A-1043 |
| |
| Design Theory (IM9) |
| 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. |
| |
| Thursday June 13 |
| 15:15 - 15:40 | Daniel Horsley (Monash University), Embeddings of partial Steiner triple systems with few triples, Arts A-1043 |
| 15:45 - 16:10 | Hadi Kharaghani (University of Lethbridge), Biangular lines in $\mathbb{R}^n$, Arts A-1043 |
| 16:15 - 16:40 | Joy Morris (University of Lethbridge), Generalised $n$-gons with symmetry conditions, Arts A-1043 |
| 16:45 - 17:10 | David Pike (Memorial University of Newfoundland), Cycle Extensions in PBD Block-Intersection Graphs, Arts A-1043 |
| 17:15 - 17:40 | Doug Stones (Dalhousie University), Enumeration and symmetries of partial Latin rectangles, Arts A-1043 |
| |
| Enumerative Combinatorics (IM1) |
| 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. |
| |
| Monday June 10 |
| 10:10 - 10:35 | Sergi Elizalde (Dartmouth College), Bijections for lattice paths between two boundaries, Arts A-1043 |
| 10:40 - 11:05 | Bruce Sagan (Michigan State University), A factorization theorem for $m$-rook placements, Arts A-1043 |
| 11:10 - 11:35 | Alejandro Morales (LaCIM, UQAM), Counting matrices over finite fields with zeroes on Rothe diagrams, Arts A-1043 |
| 11:40 - 12:05 | Mathilde Bouvel (CNRS/LaBRI Bordeaux I), Operators of equivalent sorting power and related Wilf-equivalences, Arts A-1043 |
| 12:10 - 12:35 | Markus Nebel (University of Kaiserslautern), The Combinatorics of RNA in the Polymere Zeta Model, Arts A-1043 |
| |
| Extremal Combinatorics (IM8) |
| 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. |
| |
| Thursday June 13 |
| 10:10 - 10:35 | Penny Haxell (University of Waterloo), Extremal hypergraphs for packing and covering, Arts A-1043 |
| 10:40 - 11:05 | John Lenz (University of Illinois at Chicago), Hypergraph Quasirandomness, Arts A-1043 |
| 11:10 - 11:35 | Sergey Norin (McGill University), Forcing multidimensional graphons, Arts A-1043 |
| 11:40 - 12:05 | Mathias Schacht (Universität Hamburg), Sharp threshold vor van der Waerden's theorem, Arts A-1043 |
| 12:10 - 12:35 | Jacques Verstraete (UCSD), Random Independent Sets in Hypergraphs, Arts A-1043 |
| |
| Graph Theory (IM5) |
| Organizer and Chair: Matthias Kriesell (Universität Hamburg) |
| |
| Wednesday June 12 |
| 10:10 - 10:35 | Johannes Carmesin (Universität Hamburg), Canonical tree decomposition into highly connected pieces, Arts A-1043 |
| 10:40 - 11:05 | Bojan Mohar (Simon Fraser University/University of Ljubljana), On median eigenvalues of graphs, Arts A-1043 |
| 11:10 - 11:35 | Jonathan Noel (McGill University), Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond, Arts A-1043 |
| 11:40 - 12:05 | Robert Šámal (Charles University), Cycle-continuous mappings -- order structure, Arts A-1043 |
| 12:10 - 12:35 | Gábor Simonyi (Hungarian Academy of Sciences), Comparing the local chromatic number of a digraph and its underlying undirected graph, Arts A-1043 |
| |
| Probabilistic Combinatorics (IM7) |
| 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. |
| |
| Wednesday June 12 |
| 15:15 - 15:40 | Bruce Reed (McGill University), Variants of the Erdos-Sos Conjecture, Arts A-1046 |
| 15:45 - 16:10 | Tom Bohman (Carnegie Mellon University), Self-correcting estimates for the triangle free process, Arts A-1046 |
| 16:15 - 16:40 | Amin Coja-Oghlan (Goethe University Frankfurt/Main), Chasing the k-SAT threshold, Arts A-1046 |
| 16:45 - 17:10 | Mike Molloy (University of Toronto), Clusters of solutions to random linear equations, Arts A-1046 |
| 17:15 - 17:40 | David Galvin (University of Notre Dame), Colouring regular bipartite graphs, cubes and grids, Arts A-1046 |
