The length characterization of covers in the double-affine Bruhat order

Let WTW_{\mathcal{T}} be the double-affine Weyl monoid, equipped with its Bruhat order << and length function \ell. Write xyx\lhd y when yy covers xx, meaning that x<yx<y and there is no zz with x<z<yx<z<y. The cover-length conjecture. For x,yWTx,y\in W_{\mathcal{T}}, one has

xyx<y and (y)=(x)+1.x\lhd y \quad\Longleftrightarrow\quad x<y\text{ and }\ell(y)=\ell(x)+1.

The conjecture asks whether the length difference always detects covering relations in the double-affine Bruhat order, as it does for ordinary Coxeter-group Bruhat orders. The paper establishes that a cover must arise from multiplication by a reflection, but the converse characterization by length remains open in the double-affine setting.

Sources & referencesView supporting material

Primary source

Dinakar Muthiah and Daniel Orr, “On the double-affine Bruhat order: the ε=1 conjecture and classification of covers in ADE type”, arXiv:1609.03653 (2016).

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.