As a consequence, Gelfand–Tsetlin polytopes have integer vertices, and have the integer decomposition property (IDP). This means that if is a lattice point in k GT λ μ for some integer k ≥ 1 , then can be expressed as p 1 + ⋯ + p k where each is a lattice point in.
Sep 19, 2003 · As an application, we disprove a conjecture of Berenstein and Kirillov about the integrality of all vertices of the Gelfand-Tsetlin polytopes.
Sep 2, 2004 · As an application, we disprove a conjecture of Berenstein and Kirillov about the integrality of all vertices of the Gelfand–Tsetlin polytopes.
Abstract: This paper is a study of the polyhedral geometry of Gelfand-Tsetlin patterns arising in the representation theory glnC and algebraic combinatorics ...
(PDF) Vertices of Gelfand-Tsetlin Polytopes - ResearchGate
www.researchgate.net › publication › 21...
This paper is a study of the polyhedral geometry of Gelfand-Tsetlin patterns arising in the representation theory $\mathfrak{gl}_n \C$ and algebraic ...
This paper concerns the enumerative combinatorics on Gelfand–Cetlin polytopes, in particular counting the number faces in each dimension.
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 ...
This paper disproves a conjecture of Berenstein and Kirillov about the integrality of all vertices of the Gelfand–Tsetlin polytopes and derives a bound on ...
Gelfand–Tsetlin polytopes are prominent objects in algebraic combinatorics. The number of integer points of the Gelfand–Tsetlin polytope GT(λ) is equal to ...
Sep 30, 2020 · Gelfand-Tsetlin polytope: λ=(dy-d). GT (x) C1R (3) the polytope of real-valued. GT-patterns with top row t. ال. = (!. -. # (GTQ) n Z (1)). 7.