The combinatorics seminar at KTH

September 30, 2009

Greg Smith (Queens U and KTH): Eulerian numbers and Laurent polynomials

Abstract:

Duistermaat and van der Kallen prove that there are no nontrivial Laurent polynomials all of whose powers have a zero constant term. Motivated by this result, Sturmfels asks for an effective version: Can we enumerate the Laurent polynomials that have the longest possible sequence of powers with zero constant terms? In this talk, we'll show that the attractively simple answer is given by the Eulerian numbers. The proof involves reinterpreting the problem in terms of toric geometry.

Back to the combinatorics seminar