ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.