Let w be a special permutation with code
code(w)=(n,∗,n−1,∗,n−2,…,∗,2,∗,1,0,0,…),
where each ∗ is either 0 or empty. Let a1<⋯<ak=n+k be the positions of the zeros in the code that are preceded by a nonzero entry. Define
aδ(y1,…,yn)=1≤i<j≤n∏(yi−yj).
An n-element subset J={j1,…,jn} of {1,2,…,n+k} is valid if
#(J∩{ai−1+1,ai−1+2,…,ai})=ai−ai−1−1
for 1≤i≤k, with a0=0, and let εJ=(−1)dJ, where
dJ=(2n+k+1)−1−(a1+1)−⋯−(ak−1+1)−i∈J∑i.
The conjectured formula for Dw. For special w,
Dw=CnkJ={j1,…,jk}∑εJaδ(yn+k−j1+1,yn+k−j2+1,…,yn+k−jk+1),
where
Cnk=(2n+1)!(n+1)!(n+2)!⋯(n+k−1)!
and J ranges over all valid subsets of {1,2,…,n+k}. This gives a proposed explicit value for the polynomial Dw associated with a special permutation.