The conjectured formula for for special permutations
The conjectured formula for for special permutations
Let be a special permutation with code
where each is either or empty. Let be the positions of the zeros in the code that are preceded by a nonzero entry. Define
An -element subset of is valid if
for , with , and let , where
The conjectured formula for . For special ,
where
and ranges over all valid subsets of . This gives a proposed explicit value for the polynomial 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
Sign in to submit a solution.
No solutions have been posted yet.