Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
Eulerian numbers, tableaux, and the Betti numbers of a toric variety
Discrete Mathematics - Special volume: algebraic combinatorics
Discrete & Computational Geometry
Hi-index | 0.00 |
Duistermaat and van der Kallen show that there is no nontrivial complex Laurent polynomial all of whose powers have a zero constant term. Inspired by this, Sturmfels poses two questions: Do the constant terms of a generic Laurent polynomial form a regular sequence? If so, then what is the degree of the associated zero-dimensional ideal? In this note, we prove that the Eulerian numbers provide the answer to the second question. The proof involves reinterpreting the problem in terms of toric geometry.