Log-concavity of characters of parabolic Verma modules, and of restricted Kostant partition functions
Abstract
In 2022, Huh-Matherne-M\'esz\'aros-St. Dizier showed that normalized Schur polynomials are Lorentzian, thereby yielding their continuous (resp. discrete) log-concavity on the positive orthant (resp. on their support, in type A root directions). A reinterpretation of this result is that the characters of finite-dimensional simple representations of sln+1(C) are denormalized Lorentzian (DL). In the same paper, these authors also showed that shifted characters of Verma modules over sln+1(C) are DL. In this work we extend these results to a larger family of modules that subsumes both of the above: we show that shifted characters of all parabolic Verma modules over sln+1(C) are denormalized Lorentzian. The proof involves certain graphs on [n+1]; more strongly, we explain why the character (i.e., generating function) of the Kostant partition function of any loopless multigraph on [n+1] is Lorentzian after shifting and normalizing. We then show that parabolic Vermas form a "maximal" class with log-concave (hence DL) characters. Namely, log-concavity fails in greater generality along three natural directions: (1) it does not hold for every simple Lie type, (2) nor for a larger universal family of highest weight modules, the higher order Verma modules, even in type A, and (3) it does not always hold for important generalizations of Schur polynomials: the Jack and Macdonald polynomials. Finally, we extend these results to parabolic (i.e. "first order") and higher order Verma modules over the semisimple Lie algebras t=1T slnt+1(C). We also partially resolve a conjecture of Huh et al on the DL property for integral highest weight simple modules.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.