The Applied Algebra Seminar
A Monday afternoon research seminar

About the seminar (click here to see more)


The seminar is currently organized by Lucas Gagnon and Nantel Bergeron.

Schedule

Dates are listed in reverse-chronological order. Unless otherwise indicated, all in person talks will take place on Monday from 15:00-16:00 in N638 Ross Building (York University).

Spring 2025

Date Speaker Title (click titles for abstract)
14 April 2025
Seeking Speaker
TBA
7 April 2025
Seeking Speaker
TBA
31 March 2025 Seeking Speaker
TBA
24 March 2025
Seeking Speaker
TBA
17 March 2025 Seeking Speaker
TBA
10 March 2025
Seeking Speaker
TBA
3 March 2025 Karen Yeats
U. Waterloo
Combinatorial interpretation of the coefficients of the BDG action in causal set theory
Causal set theory is a model of quantum gravity where the underlying spacetime is a locally finite poset. The Benincasa-Dowker-Glaser (BDG) action is an action on a causal set which corresponds to the classical Einstein-Hilbert action. L. Glaser gave formulas for the coefficients of the BDG action which cry out for a combinatorial interpretation. I will give an interpretation in terms of certain chord diagrams that holds for all dimensions and explain how it relates in the even dimensional case to previous interpretations I explained last winter at the CMS meeting using lattice walks. No familiarity with causal set theory is required.
24 Feb. 2025
Seeking Speaker
TBA
17 Feb. 2025 Reading Week
27 Jan. 2025 Clément Chenevière
Université Paris-Saclay
A new description for m-Cambrian lattices
Cambrian lattices, introduced by N. Reading in 2006, are a generalization of the Tamari lattice to any choice of Coxeter element in any finite Coxeter group. The Tamari lattice corresponds to the ``linear type A''. These partial orders admit many descriptions, non trivially equivalent. These give rise to a common generalization by C. Stump, H. Thomas, and N. Williams, called the m-Cambrian lattices. However, none of these descriptions provide a practical setup to work with combinatorially. In an ingoing work with Wenjie Fang and Corentin Henriet, we propose a new equivalent definition of m-Cambrian lattices, with an easy and effective criterion on simple objects called m-noncrossing partitions. This definition is obtained by proving that any interval contains a unique maximal chain that is c-increasing, and it can be computed with a greedy algorithm. We also introduce an interesting "almost" partial order on Cambrian intervals, which is new, even in the case of the Tamari lattice.

Fall 2024


Archives

Below you will find links to the seminar webpages for previous years.
Year 2023-24 Year 2022-23 Year 2020-21 Year 2019-20 Year 2018-19
Year 2017-18 Year 2016-17 Year 2015-16 Year 2014-15 Year 2013-14
Year 2012-13 Year 2011-12 Year 2010-11 Year 2009-10 Year 2008-09
Fall 2007 Winter 2006 Fall 2005 Winter 2005 Fall 2004
Winter 2004 Fall 2003 Winter 2003 Fall 2002 Winter 2002
Fall 2001 Winter 2001 Fall 2000 Winter 2000 Fall 1999
Winter 1999 Fall 1998 Winter 1998 Fall 1997