conjecture. Let us describe the formula in vague terms.1 Consider permutations x, y \in Sn+1 , which we view as permutations of 0, 1, .
Statement
conjecture. Let us describe the formula in vague terms.1 Consider permutations x, y \in Sn+1 , which we view as permutations of 0, 1, . . . , n. Suppose that x \leq y in Bruhat order. The set of elements {z \in Sn+1 | x(n) = z(n)} has a unique maximum c. Moreover, the interval [x, c] consists exactly of the intersection of the coset Sn \cdot x with [x, y], where Sn consists of permutations of 0, 1, . . . , n − 1. The formula says: \partialPx,y = Ix,y,c + Hx,y,c Here: (1) \partialPx,y is the “q-derivative” of the Kazhdan-Lusztig polynomial. It is de- fined by the formula Px,y (q) − q ℓ(y)−ℓ(x) Px,y (q −1 ) \partialPx,y = . 1−q (This polynomial is rather standard in the theory, and the Kazhdan- Lusztig polynomial Px,y can be recovered from it, thanks to the degree bounds for Kazhdan-Lusztig polynomials.) (2) Ix,y,c is the “inductive piece”, which depends only on the (inductively known) Kazhdan-Lusztig polynomials Pz,y and Px,z for for z \in (x, c]. (3) Hx,y,c is the “hypercube cluster piece” which only depends on the (induc- tively known) Kazhdan-Lusztig polynomials Pu,y for u in the set Hx,y,c = {tx \in [x, y] | tx \in / [x, c]}. (That is, these are precisely the vertices neighbouring x in the Bruhat graph, which do not lie in [x, c].) More precisely, its definition is as follows. First consider the polynomial X He x,y,c = (q − 1)|I| P\theta(I),y \varnothing6=I\subsetHx,y,c 1The details are too involved for an Oberwolfach report, but will appear soon on the arxiv.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.