Billey–Fan–Losonczy's Lehmer-code conjecture for rationally smooth elements

About 1 year old · traced to

Let WW be a finite Weyl group, let w∈Ww\in W be rationally smooth, and let [e,w][e,w] be its Bruhat interval. A Lehmer code is an order-preserving bijection from a product of chains to [e,w][e,w].

Billey–Fan–Losonczy's conjecture. The interval [e,w][e,w] admits a Lehmer code.

Gasharov proved the corresponding statement for W=SnW=S_n. The conjecture has been resolved affirmatively in types AA and BB, and the paper resolves it in all types except EE; in types H4H_4 and F4F_4, the longest element is the stated exception.

References

Primary source

Christian Gaetz and Yibo Gao, “Billey-Postnikov posets, rationally smooth Schubert varieties, and Poincaré duality”, arXiv:2512.08168 (2026).

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.