On the combinatorics of string polytopes
Combinatorics
2019-04-03 v1 Algebraic Geometry
Abstract
For a reduced word of the longest element in the Weyl group of , one can associate the string cone which parametrizes the dual canonical bases. In this paper, we classify all 's such that is simplicial. We also prove that for any regular dominant weight of , the corresponding string polytope is unimodularly equivalent to the Gelfand-Cetlin polytope associated to if and only if is simplicial. Thus we completely characterize Gelfand-Cetlin type string polytopes in terms of .
Cite
@article{arxiv.1904.00130,
title = {On the combinatorics of string polytopes},
author = {Yunhyung Cho and Yoosik Kim and Eunjeong Lee and Kyeong-Dong Park},
journal= {arXiv preprint arXiv:1904.00130},
year = {2019}
}
Comments
29 pages, 16 figures