Combinatorial Invariance of Relative R-polynomials in the Hermitian Symmetric Case

Abstract

We develop a marking system for an analog of Hasse diagrams of intervals [u,v] with u≤ v in a Hermitian symmetric pair W/WJ, and use this to create a closed form algorithm for computing relative R-polynomials. The uniform nature of this algorithm allows us to show combinatorial invariance of relative Kazhdan-Lusztig polynomials in the Hermitian symmetric space setting.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…