The polytope of Tesler matrices
Abstract
We introduce the Tesler polytope Tesn(a1,a2,...,an), whose integer points are the Tesler matrices of size n with nonnegative integer hook sums a1,a2,...,an. We show that Tesn(a) is a flow polytope and therefore the number of Tesler matrices is counted by the type An Kostant partition function evaluated at (a1,a2,...,an,-a1-...-an). We describe the faces of this polytope in terms of "Tesler tableaux" and characterize when the polytope is simple. We prove that the h-vector of Tesn(a) when all ai>0 is given by the Mahonian numbers and calculate the volume of Tesn(1,1,...,1) to be a product of consecutive Catalan numbers multiplied by the number of standard Young tableaux of staircase shape.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.