Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 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

Ehrhart positivity and Demazure characters (1812.03345v1)

Published 8 Dec 2018 in math.CO

Abstract: Demazure characters, also known as key polynomials, generalize the classical Schur polynomials. In particular, when all variables are set equal to $1$, these polynomials count the number of integer points in a certain class of Gelfand--Tsetlin polytopes. This property highlights the interaction between the corresponding polyhedral and combinatorial structures via Ehrhart theory. In this paper, we give an overview of results concerning the interplay between the geometry of Gelfand-Tsetlin polytopes and their Ehrhart polynomials. Motivated by strong computer evidence, we propose several conjectures about the non-negativity of the coefficients of such polynomials.

Summary

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