Papers
Topics
Authors
Recent
Search
2000 character limit reached

The polytope of Tesler matrices

Published 30 Sep 2014 in math.CO | (1409.8566v3)

Abstract: We introduce the Tesler polytope Tes_n(a_1,a_2,...,a_n), whose integer points are the Tesler matrices of size n with nonnegative integer hook sums a_1,a_2,...,a_n. We show that Tes_n(a) is a flow polytope and therefore the number of Tesler matrices is counted by the type A_n Kostant partition function evaluated at (a_1,a_2,...,a_n,-a_1-...-a_n). 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 Tes_n(a) when all a_i>0 is given by the Mahonian numbers and calculate the volume of Tes_n(1,1,...,1) to be a product of consecutive Catalan numbers multiplied by the number of standard Young tableaux of staircase shape.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.