English

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

Combinatorics 2009-12-01 v1 Representation Theory

Abstract

We develop a marking system for an analog of Hasse diagrams of intervals [u,v][u,v] with uvu\leq v in a Hermitian symmetric pair W/WJW/W_J, 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.

Keywords

Cite

@article{arxiv.0911.5694,
  title  = {Combinatorial Invariance of Relative R-polynomials in the Hermitian Symmetric Case},
  author = {W. Andrew Pruett},
  journal= {arXiv preprint arXiv:0911.5694},
  year   = {2009}
}

Comments

21 pages, 2 figures