Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the combinatorics of string polytopes

Published 30 Mar 2019 in math.CO and math.AG | (1904.00130v1)

Abstract: For a reduced word ${\bf i}$ of the longest element in the Weyl group of $\mathrm{SL}{n+1}(\mathbb{C})$, one can associate the string cone $C{\bf i}$ which parametrizes the dual canonical bases. In this paper, we classify all ${\bf i}$'s such that $C_{\bf i}$ is simplicial. We also prove that for any regular dominant weight $\lambda$ of $\mathfrak{sl}{n+1}(\mathbb{C})$, the corresponding string polytope $\Delta{\bf i}(\lambda)$ is unimodularly equivalent to the Gelfand-Cetlin polytope associated to $\lambda$ if and only if $C_{\bf i}$ is simplicial. Thus we completely characterize Gelfand-Cetlin type string polytopes in terms of ${\bf i}$.

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.