Generating Functions of Key Polynomials and Bounded Ascending Sequences of Integers - presented by Dr. Shaul Zemel

Generating Functions of Key Polynomials and Bounded Ascending Sequences of Integers

Dr. Shaul Zemel

SZ
Ask the seminar a question! BETA
Generating Functions of Key Polynomials and Bounded Ascending Sequences of Integers
SZ
Shaul Zemel
Hebrew University of Jerusalem

The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. In this talk we present a work in progress with Noah Cape investigating the generating functions of another family of polynomials, the key polynomials, also known as Demazure characters.

Each component in that function is a rational function, whose denominator is an explicit product whose definition is based on bounded ascending sequences of integers.

We can also determine the first terms of the polynomial numerator, and we introduce resulting conjectural relations between the coefficients in key polynomials and signed sums of numbers of integral points on polytopes.

References
  • 1.
    S. C. Billey et al. (1993) [Unknown]. Journal of Algebraic Combinatorics
  • 2.
    S. Mason (2008) An explicit construction of type A Demazure atoms. Journal of Algebraic Combinatorics
  • 3.
    Cara Monical (2016) Set-Valued Skyline Fillings.
The Journal of Algebraic Combinatorics logo
Journal of Algebraic Combinatorics Webinar Series
The Journal of Algebraic Combinatorics
Cite as
S. Zemel (2024, October 15), Generating Functions of Key Polynomials and Bounded Ascending Sequences of Integers
Share
Details
Listed seminar This seminar is open to all
Recorded Available to all
Video length 1:00:25
Q&A Now closed
Disclaimer The views expressed in this seminar are those of the speaker and not necessarily those of the journal