相关论文: On the combinatorics of string polytopes

The combinatorics of reduced words and commutation classes plays an important role in geometric representation theory. A string polytope is a lattice polytope associated to each reduced word of the longest element $w_0$ in the symmetric…

Let $G$ be a semisimple algebraic group over $\mathbb{C}$. For a reduced word $\bf i$ of the longest element in the Weyl group of $G$ and a dominant integral weight $\lambda$, one can construct the string polytope $\Delta_{\bf i}(\lambda)$,…

A string polytope is a rational convex polytope whose lattice points parametrize a highest weight crystal basis, which is obtained from a string cone by explicit affine inequalities depending on a highest weight. It also inherits geometric…

We show that for each reduced expression for the longest word in the Weyl group of type A_n, the corresponding cone arising in Lusztig's description of the canonical basis in terms of tight monomials is simplicial, and construct explicit…

We prove that for every complex classical group $G$ the string polytope associated to a special reduced decomposition and any dominant integral weight $\lambda$ will be a lattice polytope if and only if the highest weight representation of…

In this paper, we establish that FFLV polytopes, which describe monomial bases compatible with the PBW filtration on finite-dimensional simple modules for $\lie{sl}_n$ and $\lie{sp}_n$, are actually string polytopes as described by…

In this short note we announce three formulas for the set of weights of various classes of highest weight modules $\V$ with highest weight \lambda, over a complex semisimple Lie algebra $\lie{g}$ with Cartan subalgebra $\lie{h}$. These…

Let $\lambda$ be a dominant weight of a finite dimensional simple Lie algebra and $W$ the Weyl group. The convex hull of $W\lambda$ is defined as the weight polytope of $\lambda$. We provide a new proof that there is a natural bijection…

For any root system of rank $r$, we study the "dominant weight polytope" $P^\lambda$ associated with a strongly dominant weight $\lambda$. We prove that $P^\lambda$ is combinatorially equivalent to the $r$-dimensional cube. As an…

We give the first positive formulas for the weights of every simple highest weight module $L(\lambda)$ over an arbitrary Kac-Moody algebra. Under a mild condition on the highest weight, we also express the weights of $L(\lambda)$ as an…

For a simply connected connected simple algebraic group $G$, it is known that a variety $B_{w_0}^-:=B^-\cap U\overline{w_0}U$ has a geometric crystal structure with a positive structure…

In this paper we use the superpotential for the flag variety $GL_n/B$ and particular coordinate systems that we call ideal coordinates for $\mathbf{i}$, to construct polytopes $\mathcal{P}^{\mathbf{i}}_\lambda$ inside $\mathbb{R}^{R_+}$,…

For a simple Lie algebra $\mathfrak{g}$ of type $A_n,B_n,C_n$ or $D_n$, we give a characterization of the set of dominant integral weights $\lambda$ such that for any rational point $\mu$ in the fundamental Weyl chamber, $2\lambda-\mu$ is a…

Let $G$ be a simply connected semisimple algebraic group over $\mathbb{C}$ and let $\rho :G\rightarrow GL(V_\lambda)$ be an irreducible representation of highest weight $\lambda$. Suppose that $\rho$ has finite kernel. Springer defined…

Let B be a reductive Lie subalgebra of a semi-simple Lie algebra of the same rank both over the complex numbers. To each finite dimensional irreducible representation $V_\lambda$ of F we assign a multiplet of irreducible representations of…

The negative part $U^-$ of a quantised enveloping algebra associated to a simple Lie algebra possesses a canonical basis $\mathcal{B}$ with favourable properties. Lusztig has associated a cone to a reduced expression $\mathbf{i}$ for the…

It is well known that there is a deep relationship between codes and lattices. Concepts from coding theory are related to concepts of lattice theory as, for example, weight enumerators to theta series, MacWilliams identity to Jacobi…

This paper analyses stable commutator length in groups Z^r * Z^s. We bound scl from above in terms of the reduced wordlength (sharply in the limit) and from below in terms of the answer to an associated subset-sum type problem. Combining…

We generalize the famous weight basis constructions of the finite-dimensional irreducible representations of $\mathfrak{sl}(n,\mathbb{C})$ obtained by Gelfand and Tsetlin in 1950. Using combinatorial methods, we construct one such basis for…

We exploit the idea that the character of an irreducible finite dimensional $\mathfrak{gl}_n$-module is the sum of certain exponents of integer points in a Gelfand-Tsetlin polytope and can thus be calculated via Brion's theorem. In order to…