On the combinatorics of string polytopes

From MaRDI portal




Abstract: For a reduced word of the longest element in the Weyl group of mathrmSLn+1(mathbbC), 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 lambda of mathfraksln+1(mathbbC), the corresponding string polytope is unimodularly equivalent to the Gelfand-Cetlin polytope associated to lambda if and only if is simplicial. Thus we completely characterize Gelfand-Cetlin type string polytopes in terms of .



Cites work



Describes a project that uses

Uses Software





This page was built for publication: On the combinatorics of string polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2049443)