Abstract
This paper is a study of the polyhedral geometry of Gelfand–Tsetlin polytopes arising in the representation theory of ${\frak gl}_n \Bbb C$ and algebraic combinatorics. We present a combinatorial characterization of the vertices and a method to calculate the dimension of the lowest-dimensional face containing a given Gelfand–Tsetlin pattern. As an application, we disprove a conjecture of Berenstein and Kirillov about the integrality of all vertices of the Gelfand–Tsetlin polytopes. We can construct for each $n\geq5$ a counterexample, with arbitrarily increasing denominators as $n$ grows, of a nonintegral vertex. This is the first infinite family of nonintegral polyhedra for which the Ehrhart counting function is still a polynomial. We also derive a bound on the denominators for the nonintegral vertices when $n$ is fixed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
