← All problems

Reiner–Tenner–Yong's Fomin–Kirilov polynomial ratio conjecture

8 years old · traced to

Let ww be a dominant permutation, meaning a 132-avoiding permutation, whose Lehmer code λ=(c1(w),…,cn(w))\lambda=(c_1(w),\ldots,c_n(w)) is the rectangular staircase shape λ=δd(ba)\lambda=\delta_d(b^a), where δd=(d−1,d−2,…,1)\delta_d=(d-1,d-2,\ldots,1) and δd(ba)\delta_d(b^a) is obtained by replacing each square by an a×ba\times b rectangle. Let ℓ(w)\ell(w) denote the length of ww, and let FK(w,ℓ)FK(w,\ell) be the polynomial defined by summing (x+i1)⋯(x+iℓ)(x+i_1)\cdots(x+i_\ell) over all 0-Hecke words (si1,…,siℓ)(s_{i_1},\ldots,s_{i_\ell}) of ww of length ℓ\ell. Reiner, Tenner and Yong's equivalent conjecture.

FK(w,ℓ(w)+1)FK(w,ℓ(w))=(ℓ(w)+12)(4xd(a+b)+1).\frac{FK(w,\ell(w)+1)}{FK(w,\ell(w))}=\binom{\ell(w)+1}{2}\left(\frac{4x}{d(a+b)}+1\right).

The source states that this assertion is equivalent to the barely set-valued tableau enumeration conjecture above. Since that conjecture is proved in the paper, this equivalent formulation is solved as well.

References

Status

  • Solved: Alejandro H. Morales, Igor Pak, and Greta Panova. Proof of a Conjecture of Reiner-Tenner-Yong on Barely Set-valued Tableaux (arXiv, 2018) https://arxiv.org/abs/1807.08292

Source: Neil J. Y. Fan, Peter L. Guo and Sophie C. C. Sun, “Proof of a Conjecture of Reiner-Tenner-Yong on Barely Set-valued Tableaux”, arXiv:1807.08292 (2018).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.