Search arXivSearch

arXiv · 1501.04275

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

Abstract

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 $S_n$ be the symmetric group on $\{1,2,\ldots,n\}$, and let $S=\{s_i\,|\, 1\leq i\leq n-1\}$ be the generating set of $S_n$, where for $1\leq i\leq n-1$, $s_i$ is the adjacent transposition. For a subset $J\subseteq S$, let $(S_n)_J$ be the parabolic subgroup generated by $J$, and let $(S_n)^{J}$ be the set of minimal coset representatives for $S_n/(S_n)_J$. For $u\leq v\in (S_n)^J$ in the Bruhat order and $x\in \{q,-1\}$, let $R_{u,v}^{J,x}(q)$ denote the parabolic $R$-polynomial indexed by $u$ and $v$. Brenti found a formula for $R_{u,v}^{J,x}(q)$ when $J=S\setminus\{s_i\}$, and obtained an expression for $R_{u,v}^{J,x}(q)$ when $J=S\setminus\{s_{i-1},s_i\}$. We introduce a statistic on pairs of permutations in $(S_n)^J$ for $J=S\setminus\{s_{i-2},s_{i-1},s_i\}$. Then we give a formula for $R_{u,v}^{J,x}(q)$, where $J=S\setminus\{s_{i-2},s_{i-1},s_i\}$ and $i$ appears after $i-1$ in $v$. We also pose a conjecture for $R_{u,v}^{J,x}(q)$, where $J=S\setminus\{s_{k},s_{k+1},\ldots,s_i\}$ with $1\leq k\leq i\leq n-1$ and the elements $k+1,k+2,\ldots, i$ appear in increasing order in $v$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Neil J. Y. Fan, Peter L. Guo, Grace L. D. Zhang. 2015-01-18. On parabolic Kazhdan-Lusztig R-polynomials for the symmetric group. https://arxiv.org/abs/1501.04275

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO