Abstract
Abstract
We prove a recurrence for Koornwinder ASEP polynomials, which expresses the polynomials associated with a partition $\lambda$ in terms of those associated with $\lambda^-$, the partition obtained from $\lambda$ by subtracting 1 from every nonzero part. We then show that the coefficients encoding this recurrence are characterized by a family of relations that we call local rules. The proof relies on a refinement of the polynomial representation of the affine Hecke algebra of type C.
As an application, we obtain a formula in terms of multiline queues for the top homogeneous parts of Koornwinder ASEP polynomials, and deduce that, for signed compositions with nonnegative parts, the top homogeneous part is the corresponding type A ASEP polynomial. We also prove an analogous result for nonsymmetric Koornwinder polynomials.
Abstract
Winter 2027 (Tentative)
Past Talks (This Term)
Abstract
Abstract
Abstract
Abstract
Abstract
Abstract
Abstract
Abstract
Abstract
Abstract
Abstract
I'll give a gentle introduction to tropical QFT and some specific other applications of tropical geometry in QFT. The course is aimed at PhD level. Basic to intermediate QFT understanding will be sufficient to follow the course. Everyone is welcome!
Abstract
This is joint work with Raul Penaguiao.
Abstract
Abstract
Abstract
Abstract
About the Seminar
This is the website for the Algebraic and Enumerative Combinatorics Seminar at the University of Waterloo. We view algebraic combinatorics broadly, explicitly including algebraic enumeration and related asymptotic and bijective combinatorics as well as algebraic combinatorics as it appears in pure algebra and in applications outside mathematics.
We usually meet on Thursdays in MC 5417 using a pre-seminar and seminar format. Anyone is welcome to attend either or both sessions.
At 1:30 PM, we begin with a 45-minute pre-seminar designed to get participants up to speed on useful and interesting background for the talk, at a level accessible to beginning graduate students or researchers working in different areas. The format may be an introductory lecture, a problem session, or a mix of both. After the pre-seminar, there is a short coffee break.
At 2:30 PM, we resume with the main seminar: a 50-minute talk, plus 10 minutes for questions. Our audience consists primarily of combinatorics faculty and grad students.