Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Newton-Okounkov polytopes of flag varieties and marked chain-order polytopes (2104.09929v1)

Published 20 Apr 2021 in math.AG, math.CO, and math.RT

Abstract: Marked chain-order polytopes are convex polytopes constructed from a marked poset, which give a discrete family relating a marked order polytope with a marked chain polytope. In this paper, we consider the Gelfand-Tsetlin poset of type A, and realize the associated marked chain-order polytopes as Newton-Okounkov bodies of the flag variety. Our realization connects previous realizations of Gelfand-Tsetlin polytopes and Feigin-Fourier-Littelmann-Vinberg polytopes as Newton-Okounkov bodies in a uniform way. As an application, we prove that the flag variety degenerates into the irreducible normal projective toric variety corresponding to a marked chain-order polytope. We also construct a specific basis of an irreducible highest weight representation which is naturally parametrized by the set of lattice points in a marked chain-order polytope.

Summary

We haven't generated a summary for this paper yet.