The conjectured formula for d54dwd54d_w for special permutations

From papers

Let ww be a special permutation with code

code(w)=(n,,n1,,n2,,,2,,1,0,0,),\operatorname{code}(w)=(n,*,n-1,*,n-2,\dots,*,2,*,1,0,0,\dots),

where each * is either 00 or empty. Let a1<<ak=n+ka_1<\cdots<a_k=n+k be the positions of the zeros in the code that are preceded by a nonzero entry. Define

aδ(y1,,yn)=1i<jn(yiyj).a_\delta(y_1,\dots,y_n)=\prod_{1\leq i<j\leq n}(y_i-y_j).

An nn-element subset J={j1,,jn}J=\{j_1,\dots,j_n\} of {1,2,,n+k}\{1,2,\dots,n+k\} is valid if

#(J{ai1+1,ai1+2,,ai})=aiai11\#(J\cap\{a_{i-1}+1,a_{i-1}+2,\dots,a_i\})=a_i-a_{i-1}-1

for 1ik1\leq i\leq k, with a0=0a_0=0, and let εJ=(1)dJ\varepsilon_J=(-1)^{d_J}, where

dJ=(n+k+12)1(a1+1)(ak1+1)iJi.d_J=\binom{n+k+1}{2}-1-(a_1+1)-\cdots-(a_{k-1}+1)-\sum_{i\in J}i.

The conjectured formula for Dw\mathfrak{D}_w. For special ww,

Dw=CnkJ={j1,,jk}εJaδ(yn+kj1+1,yn+kj2+1,,yn+kjk+1),\mathfrak{D}_w=C_{nk}\sum_{J=\{j_1,\dots,j_k\}}\varepsilon_J\,a_\delta(y_{n+k-j_1+1},y_{n+k-j_2+1},\dots,y_{n+k-j_k+1}),

where

Cnk=(n+1)!(n+2)!(n+k1)!(n+12)!C_{nk}=\frac{(n+1)!(n+2)!\cdots(n+k-1)!}{\binom{n+1}{2}!}

and JJ ranges over all valid subsets of {1,2,,n+k}\{1,2,\dots,n+k\}. This gives a proposed explicit value for the polynomial Dw\mathfrak{D}_w associated with a special permutation.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Alexander Postnikov and Richard P. Stanley, “Chains in the Bruhat order”, arXiv:math/0502363 (2005).

Solutions 0

No solutions have been posted yet.