The Applied Algebra Seminar
A Monday afternoon research seminar

About the seminar (click here to see more)

The seminar is currently organized by Carolina Benedetti , Nantel Bergeron and Yannic Vargas.

The seminar has been running since 1997. The topics of talks have typically been any mixture of algebra with any other field: combinatorics, geometry, topology, physics, etc. Further down this page you will find links to the seminar webpages for previous years. The audience usually consists of 6–12 people, including several graduate students and post-docs. For this reason, speakers are encouraged to devote a portion of their talk to the suggestion of open problems and the directions for research in their area. If you are interested in speaking at the seminar, contact Carolina Benedetti or Nantel Bergeron.

You may also be interested in the Algebraic Combinatorics Seminar at the Fields Institute.


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

Date Speaker Title (click titles for abstract)
7 Dec. 2015
Bridget Tenner
(DePaul U.)
30 Nov. 2015
Brendan Pawlowski
(U. of Michigan)
Involution Words
Wyser and Yong have recently described polynomial representatives for the cohomology classes of O(n)- and Sp(n)-orbit closures in the complete flag variety. Many of the combinatorial aspects of Schubert polynomials and Stanley symmetric functions--e.g. pipe dreams, Edelman-Greene insertion, Lascoux-Schutzenberger's transitions--turn out to have analogues in this setting, with the role of reduced words being played by objects called (reduced) involution words. In fact, involution words can be defined starting from any Coxeter group, and I will also describe some of their Coxeter-like combinatorics.
23 Nov. 2015
Alex Yong
(U. of Illinois at Urbana-Champaign)
The Prism tableau model for Schubert polynomials
The Schubert polynomials lift the Schur basis of symmetric polynomials into a basis for Z[x1,x2,...]. We suggest the "prism tableau model" for these polynomials. A novel aspect of this alternative to earlier results is that it directly invokes semistandard tableaux; it does so as part of a colored tableau amalgam. In the Grassmannian case, a prism tableau with colors ignored is a semistandard Young tableau. Our arguments are developed from the Groebner geometry of matrix Schubert varieties. This is joint work with Anna Weigandt (arXiv:1509.02545)
16 Nov. 2015
Aaron Lauve
(Loyola U. Chicago)
Matrix Madness
Given an $n\times n$ matrix $M$ over a (possibly skew) field $F$ and a candidate inverse $X$, the system of $n^2$ equations $M\cdot X = I$ is satisfied iff $X$ is indeed an inverse for $M$ in the ring $\mathbb M_{n}(F)$ of $n\times n$ matrices. For us, it is a small wonder that the solution is the same as one would reach in solving the $n^2$ different equations $X\cdot M = I.$ We are led to the following question: from the $2n^2$ equations mentioned above, which choices of $n^2$ yield a unique solution $\overline M$ for the inverse of $M$? The case $n = 2$ is already interesting, involving a (reducible) Coxeter group of order sixteen, a nice lemma of Cohn's on the roots of noncommutative polynomials, Plücker coordinates, ... With my undergraduate students Josephine Wood and Adrienne Brackey, we are now diving heads-first into the case $n=3$. I'll report on our progress.
9 Nov. 2015
Kiumars Kaveh
(U. of Pittsburgh)

Systems of polynomial equations and convex bodies
We will discuss the beautiful Bernstein-Kushnirenko theorem (1975) which expresses the number of solutions of a system of n polynomial equations in n unknowns in terms of volume of convex bodies in R^n (Newton polytopes). We then talk about a far generalization of this theorem to arbitrary systems of equations on algebraic varieties via the newly emerged theory of Newton-Okounkov bodies. This theory gives a general framework to connect algebraic geometry and convex geometry. The main ingredients in this approach are combinatorial properties of semigroups of integer points. Towards the end we briefly touch on applications to other areas such as representation theory and symplectic geometry. For the most part the talk is accessible to anybody who knows the definition of a polynomial and complex numbers :)
5 Nov. 2015
N620 2:30PM
Andrei Minchenko
(Weizmann Institute)
Simple Lie conformal algebras
The notion of a Lie conformal algebra (LCA) comes from physics, and is related to the operator product expansion. An LCA is a module over a ring of differential operators with constant coefficients, and with a bracket which may be seen as a deformation of a Lie bracket. LCA are related to linearly compact differential Lie algebras via the so-called annihilation functor. Using this observation and the Cartan's classification of linearly compact simple Lie algebras, Bakalov, D'Andrea and Kac classified finite simple LCA in 2000. I will define the notion of LCA over a ring R of differential operators with not necessarily constant coefficients, extending the known one for R=K[x]. I will explain why it is natural to study such an object and will suggest an approach for the classification of finite simple LCA over arbitrary differential fields.
2 Nov. 2015
Johannes Rauh
(York U.)

Markov bases:
how to use them and how to compute them
Consider a system of linear integer equations $Ax = b$ and inequalities $Cx \ge d$, $x\in\mathbb{Z}^{n}$. If $m\in\ker_{\mathbb{Z}}A$, then $x+m$ is another solution, provided that $C(x+m)\ge d$. A \emph{Markov basis} $\mathcal{B}$ is a finite subset of $\ker_{\mathbb{Z}}A$ such that any two solutions $x,x'$ can be connected by iteratively adding elements (``moves'') from $\mathcal{B}$ such that all intermediate points are themselves solutions. Markov bases were first introduced in the context of Fisher's exact test for independence, where one wants to sample from the set of all integer tables with prescribed row sums and column sums. A theorem of Diaconis and Sturmfels says that finite Markov bases exist and can be chosen independently of $b$ and~$d$. Moreover, Markov bases can be computed from generating sets of toric ideals. These toric ideals consist of polynomial invariants that describe exponential families; for example, graphical models. Therefore, Markov bases also give information about these statistical models, such as the possible support sets. In my talk I give an overview of Markov bases and present a new lifting procedure that allows to compute Markov bases inductively (joint work with Seth Sullivant). This procedure can be applied to toric fiber products to obtain new finiteness results for Markov bases of families of graphical models.
26 Oct. 2015
Nantel Bergeron
(York U.)

Why find cancelation free formula for antipode?
[Joint work with Carolina Benedetti] Given a family of combinatorial objects we often have an associated graded Hopf algebra. Such algebraic structures encode the associations and decompositions of the objects we study. The antipode is a map from the Hopf algebra into itself that is defined recursively and is difficult to compute in general. Is it worth it to find a cancelation free formula for it? We start with the Hopf algebra of graphs and show the cancelation free formula of Humpert and Martin for its antipode. We will see that such formula gives a structural understanding of certain evaluations of the combinatorial invariants for graphs. In particular we recover very nicely a classical theorem of Stanley for the evaluation of the chromatic polynomial at -1. We then give a general framework where we systematically obtain cancelation free formulas for antipodes. More precisely, we define the notion of strongly linearizable Hopf monoids and show a cancelation free formula for antipodes in this case. This allows us to obtain a cancelation free formula many of the combinatorial Hopf algebras in the literature and more.
19 Oct. 2015
Rebecca Patrias
(U. of Minnesota)
Dual filtered graphs
Using the Hecke insertion algorithm of Buch-Kresh-Shimozono-Tamvakis-Yong, we define a K-theoretic analogue of Fomin's dual graded graphs called dual filtered graphs. The key formula in the definition is DU-UD=D+I. We discuss two main constructions of dual filtered graphs: the Mobius construction, which corresponds to natural insertion algorithms, and the Pieri construction, which is an algebraic construction. This is work with Pasha Pylyavskyy.
12 Oct. 2015
5 Oct. 2015
Eric Katz
(U. of Waterloo)
Hodge Theory on Matroids
The chromatic polynomial of a graph counts its proper colourings. This polynomial's coefficients were conjectured to form a unimodal sequence by Read in 1968. This conjecture was extended by Rota in his 1970 address to assert the log-concavity of the characteristic polynomial of matroids which are the common generalizations of graphs and linear subspaces. We discuss the resolution of this conjecture which is joint work with Karim Adiprasito and June Huh. The solution draws on ideas from the theory of algebraic varieties, specifically Hodge theory, showing how a question about graph theory leads to a solution involving Grothendieck's standard conjectures.


Below you will find links to the seminar webpages for previous years.
Year 2014-15 Year 2013-14 Year 2012-13 Year 2011-12 Year 2010-11
Year 2009-10 Fall 2008 & Winter 2009 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