Reiner–Tenner–Yong's Fomin–Kirilov polynomial ratio conjecture
Statement
Let be a dominant permutation, meaning a 132-avoiding permutation, whose Lehmer code is the rectangular staircase shape , where and is obtained by replacing each square by an rectangle. Let denote the length of , and let be the polynomial defined by summing over all 0-Hecke words of of length . Reiner, Tenner and Yong's equivalent conjecture.
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.
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.