7th biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM)

Christophe Hohlweg Director of the Combinatorics and Mathematical Computing Laboratory (LaCIM) is the organizer of the “Algebraic and geometric methods in combinatorics” symposium at the 7th Canadian Congress of Discrete and Algorithmic Mathematics, CanaDAM 2019 at Simon Fraser University May 28-31, 2019 in Vancouver, Canada.

The general topic of the conference is theory and applications of discrete structures.The conference will bring together researchers from various disciplines with which discrete and algorithmic mathematics interact.

The CanaDAM conference is held in odd numbered years using a format similar to the SIAM conference on Discrete Mathematics. Particular areas of interest include graphs and digraphs, hypergraphs, matroids, ordered sets, designs, coding theory, enumeration, combinatorics of words, discrete optimization, discrete and computational geometry, lattice point enumeration, combinatorial algorithms, computational complexity, and applications of discrete and algorithmic mathematics, including (but not limited to) web graphs, computational biology, communication networks, and information processing.

Concours : Bourse de doctorat Pierre Leroux 2019

This excellence scholarship is intended for a non-resident of Quebec who wishes to pursue doctoral studies in mathematics or in computer science under the direction of a researcher who is a regular member of LaCIM.

At most one scholarship will be awarded per competition.  The competition is open once every two years.

Application period : January 23 to April 1st, 2019.

Amount of scholarship: $25,000/year for three years, potentially renewable for a fourth year.

Starting date: beginning of doctoral studies.

More details on this scholarship web page

Courses on quasi-symmetric functions

Stephanie van Willigenburg (UBC), who visits us for the LaCIM Thematic Month at CRM has a CRM-Simons Chair, will give next week a mini-course on quasi-symmetric functions on tuesday wednesday and Friday. Please note that the three presentations are independent of each other.


Tuesday 9th october 3 PM PK-4323

Title: The combinatorics of quasisymmetric functions with an algebraic viewpoint

Abstract: Quasisymmetric functions were introduced by Gessel in 1984 as refinements of symmetric functions that enumerate chains in posets. Since then they have arisen in a variety of areas from representation theory to category theory. In this first talk we will define the two classical bases of quasisymmetric functions discovered by Gessel, known as the monomial and the fundamental quasisymmetric functions. We will then look at combinatorial tips and tricks for their algebraic properties such as their product and coproduct formulas. No prior knowledge is assumed.

Wednesday 10th october  4 PM PK-4323

Title: The combinatorics of quasisymmetric functions with a geometric viewpoint
Abstract: Quasisymmetric functions were introduced by Gessel in 1984 as refinements of symmetric functions that enumerate chains in posets. Since then they have arisen in a variety of areas from representation theory to category theory. In this second talk we will look at Gessel’s original approach to quasisymmetric functions as weight enumerators of chains in labelled posets, which will encode the labelling on the chains. No prior knowledge is assumed.

Friday 12th october 1.30 PM PK-4323

Title: An introduction to quasisymmetric Schur functions

Abstract: In algebraic combinatorics a central area of study is Schur functions. These functions were introduced early in the last century with respect to representation theory, and since then have become important in other areas such as quantum physics and algebraic geometry.

These functions also form a basis for the algebra of symmetric functions, which in turn forms a subalgebra of the algebra of quasisymmetric functions that itself impacts areas from category theory to card shuffling. Despite this strong connection, the existence of a natural quasisymmetric refinement of Schur functions was considered unlikely for many years.

In this talk we will meet such a natural refinement of Schur functions, called quasisymmetric Schur functions. Furthermore, we will see how these quasisymmetric Schur functions refine many well-known Schur function properties, with combinatorics that strongly reflects the classical case including diagrams, walks in the plane, and pattern avoidance in permutations.

This talk will require no prior knowledge of any of the above terms.

Algebraic combinatorics in LaCIM for CRM’s 50th anniversary

On the occasion of CRM’s 50th anniversary in 2018, the Laboratoire de Combinatoire et d’Informatique Mathématique (LaCIM) organizes a month of scientific activities to discuss the state-of-the-art and manifold interconnections between the lively topics that have long been at the core of research at LaCIM: algebraic combinatorics, combinatorial representation theory, Coxeter groups theory, combinatorics of words, discrete geometry, enumerative combinatorics, mathematical computer science and their applications.

The scientific activities will be articulated around the confirmed participations as researchers in residence of Mireille Bousquet-Mélou (LaBRI, Université de Bordeaux) and Ezra Miller (Duke University); together with a week-long international conference to be held from the 24th to the 28th of September 2018. The schedule is as follows:

September 17-22, 2018: Series of lectures by Ezra Miller (Duke University)

September 24-28, 2018: Conference Algebra and Combinatorics at LaCIM

October 1-5: Series of lectures by Mireille Bousquet-Mélou (CNRS, Université de Bordeaux)

Further information and registration details are available on the following website:


Women in mathematics in LaCIM

In occasion of the International Women’s Day 2018, the Committee for Women in Mathematics of the International Mathematical Union produced the film the Faces of Women in Mathematics.

Watch our students and postdoc Véronique Bazier-Matte, Pauline Hubert, Nadia Lafrenière, Mélodie Lapointe,  Stéphanie Schanck and Elise Vandomme them at the 11:07min.

Welcome to LaCIM

The LaCIM  (Laboratoire de Combinatoire et d’Informatique Mathématique) is a research center gathering researchers, postdoctoral fellows, as well as graduate and undergraduate students interested in discrete mathematics and theoretical computer science.

The LaCIM gathers about forty researchers, and maintain many close collaborations with most of the major research centers in this field, in particular in Canada, in France and in USA.

The LaCIM is associated with the Canada Research Chair in algebra, combinatorics and discrete mathematics of Université du Québec à Montréal, as well as the Mathematics and Computer Science Departments of the same institution. It is also one of the eight laboratoires member of the Centre de Recherche Mathématiques (CRM).