Billey–Fan–Losonczy's Lehmer-code conjecture for rationally smooth elements
Billey–Fan–Losonczy's Lehmer-code conjecture for rationally smooth elements
Let be a finite Weyl group, let be rationally smooth, and let be its Bruhat interval. A Lehmer code is an order-preserving bijection from a product of chains to .
Billey–Fan–Losonczy's conjecture. The interval admits a Lehmer code.
Gasharov proved the corresponding statement for . The conjecture has been resolved affirmatively in types and , and the paper resolves it in all types except ; in types and , the longest element is the stated exception.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Christian Gaetz and Yibo Gao, “Billey-Postnikov posets, rationally smooth Schubert varieties, and Poincaré duality”, arXiv:2512.08168 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.