Meetings/Workshops on Graph Theory and Combinatorics in Canada

ISCO (Integer Symposium on Combinatorial Optimization) is a biannual symposium whose aim is to bring together researchers from all the communities related to combinatorial optimization, including algorithms and complexity, mathematical programming, operations research, stochastic optimization, graphs and combinatorics. Quality papers on all aspects of combinatorial optimization, from mathematical foundations and theory of algorithms to computational studies and practical applications, are solicited.

May 21-22, 2020 will see the first Alberta-Montana Combinatorics and Algorithms Day hosted at the Banff International Research Station (BIRS). The event brings together faculty and students from three Alberta universities (in Calgary, Lethbridge, and Edmonton) and the University of Montana (Missoula). Combinatorics is the branch of mathematics concerned with finite sets: their properties, structures, and number. Studying the classic Rubik's Cube reveals the number of possible positions (it's 43,252,003,274,489,856,000). Understanding the cube's structure leads to efficient algorithms for solving it (an Algorithm is a sequence of well-defined instructions for solving a problem, answering a question, or even playing a game). In 2010, a group of researchers working with Google proved that every one of that staggering number of positions could be solved in no more than 20 moves.

The Fields Institute

The inaugural Queer and Trans Mathematicians in Combinatorics Conference (QTMC) will be held at the Fields Institute in Toronto from June 12-14, 2020. We anticipate an exciting program featuring both invited talks by LGBTQ+ mathematicians, and a variety of contributed talks in combinatorics and related areas. QTMC aims to address the underrepresentation and invisibility of LGBTQ+ people in the world of research mathematics. The conference will give queer and trans mathematicians a chance to network, learn, and form collaborations, in an affirming and supportive environment. Allies are welcome to participate as well. Travel funding is available for graduate students, postdocs, and other early-career mathematicians. To register or submit a paper, please visit the conference website.

Email: queertransmath@gmail.com

combinatorics, discrete math, graph theory, LGBT, LGBTQ+, queer, trans, diversity, outreach

A permutation is an ordering or arrangement of a set of objects. One might think of shuffling a pack of cards, or sorting a list of options into order of preference, or arranging the seating of passengers on an aeroplane or guests at a dinner. Permutations are central objects in many areas of mathematics. This workshop will explore aspects of permutations which arise in probability theory and related fields. This is a highly active area of study, with a variety of striking results in the last few years and many challenging problems outstanding. Random permutations have applications ranging from genetics to comupter science to economics, and arise in many challenging questions throughout mathematics. Many interesting random processes can be thought of as permutations evolving over time. The workshop will bring together researchers from many backgrounds including probability, combinatorics, physics and theoretical computer science, with the goal of advancing our understanding of random permutations and permutation processes, and of sharing ideas from across the many disparate fields where they are studied.

Dynamics is the study of systems that evolve over time. Combinatorics is the study of discrete structures such as binary strings, well-formed expressions in simple languages, data trees, colorings of graphs, etc. In Dynamical Algebraic Combinatorics, we study key parameters associated with these systems as they evolve, which helps us make sense of the underlying dynamics.

Two groups of mathematicians, who specialize either in topological combinatorics or in combinatorial commutative algebra, are organizing a workshop in order to identify and to work on problems in the intersection of both fields. Topological combinatorics uses tools from topology to study discrete structures, while combinatorial commutative algebra also studies discrete structures but uses algebraic tools. As a result, the two groups of mathematicians may be studying the exact same problem about discrete structures, but using completely different tools and mathematical language. As an example, questions about the enumeration of the faces of a topological object called a Cohen--Macaulay flag complex can be translated into questions about Hilbert functions of ideals. The goal of this workshop is to bring together 21 mathematicians in both fields to facilitate discussions and encourage new collaborations between these two groups. The organizers have identified five possible themes that will bring an additional focus to the direction of the workshop.