On parabolic Kazhdan-Lusztig R-polynomials for the symmetric group

详细信息    查看全文

• 作者：Neil J.Y. Fan^a ; ^{fan@scu.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Peter L. Guo^b ; ^{lguo@nankai.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Grace L.D. Zhang^b ; ^{zhld@mail.nankai.edu.cn" class="auth_mail" title="E-mail the corresponding author}
• 关键词：20F55 ; 05E99
• 刊名：Journal of Pure and Applied Algebra
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：221
• 期：1
• 页码：237-250
• 全文大小：359 K

文摘

Parabolic R-polynomials were introduced by Deodhar as parabolic analogues of ordinary R-polynomials defined by Kazhdan and Lusztig. In this paper, we are concerned with the computation of parabolic R  -polynomials for the symmetric group. Let 0fa" title="Click to view the MathML source">S_n$S_n$ be the symmetric group on {1,2,…,n}$\{1,2,\dots ,n\}$, and let $S=\{s_i|1\le i\le n-1\}$ be the generating set of 0fa" title="Click to view the MathML source">S_n$S_n$, where for 1≤i≤n−1$1\le i\le n-1$, s_i$s_i$ is the adjacent transposition. For a subset J⊆S$J\subseteq S$, let f697f546828c6f758" title="Click to view the MathML source">(S_n)_J${(S_n)}_J$ be the parabolic subgroup generated by J  , and let f69187fd7813e6cf431e93" title="Click to view the MathML source">(S_n)^J${(S_n)}^J$ be the set of minimal coset representatives for S_n/(S_n)_J$S_n/{(S_n)}_J$. For u≤v∈(S_n)^J$u\le v\in {(S_n)}^J$ in the Bruhat order and x∈{q,−1}$x\in \{q,-1\}$, let 20" width="53" alt="View the MathML source" title="View the MathML source" src="/sd/grey_pxl.gif" data-inlimgeid="1-s2.0-S0022404916300780-si12.gif">$R_{u,v}^{J,x}(q)$ denote the parabolic R-polynomial indexed by u and v  . Brenti found a formula for 20" width="53" alt="View the MathML source" title="View the MathML source" src="/sd/grey_pxl.gif" data-inlimgeid="1-s2.0-S0022404916300780-si12.gif">$R_{u,v}^{J,x}(q)$ when J=S∖{s_i}$J=S\setminus \{s_i\}$, and obtained an expression for 20" width="53" alt="View the MathML source" title="View the MathML source" src="/sd/grey_pxl.gif" data-inlimgeid="1-s2.0-S0022404916300780-si12.gif">$R_{u,v}^{J,x}(q)$ when J=S∖{s_i−1,s_i}$J=S\setminus \{s_{i-1},s_i\}$. In this paper, we provide a formula for 20" width="53" alt="View the MathML source" title="View the MathML source" src="/sd/grey_pxl.gif" data-inlimgeid="1-s2.0-S0022404916300780-si12.gif">$R_{u,v}^{J,x}(q)$, where J=S∖{s_i−2,s_i−1,s_i}$J=S\setminus \{s_{i-2},s_{i-1},s_i\}$ and i   appears after i−1$i-1$ in v. It should be noted that the condition that i   appears after i−1$i-1$ in v is equivalent to that v   is a permutation in 0f0e37e0" title="Click to view the MathML source">(S_n)^{S∖{s_i−2,s_i}}${(S_n)}^{S\setminus \{s_{i-2},s_i\}}$. We also pose a conjecture for 20" width="53" alt="View the MathML source" title="View the MathML source" src="/sd/grey_pxl.gif" data-inlimgeid="1-s2.0-S0022404916300780-si12.gif">$R_{u,v}^{J,x}(q)$, where J=S∖{s_k,s_k+1,…,s_i}$J=S\setminus \{s_k,s_{k+1},\dots ,s_i\}$ with 1≤k≤i≤n−1$1\le k\le i\le n-1$ and v   is a permutation in 20" class="mathmlsrc">20.gif&_user=111111111&_pii=S0022404916300780&_rdoc=1&_issn=00224049&md5=c99bd72a4a3c29196cb8bf4f62f83f5c" title="Click to view the MathML source">(S_n)^{S∖{s_k,s_i}}.