Kazhdan–Lusztig's combinatorial invariance conjecture for Kazhdan–Lusztig polynomials
Let be a Coxeter system, and let . The interval is the set of elements between and in the Bruhat order, and denotes the classical Kazhdan–Lusztig polynomial.
Kazhdan–Lusztig's combinatorial invariance conjecture. The polynomial depends only on the isomorphism class of the interval as a poset.
This conjecture asks whether the classical Kazhdan–Lusztig polynomial is determined by the abstract Bruhat interval, rather than by the Coxeter system and its labeling. It was independently formulated by Lusztig and Dyer; the supplied text gives no resolution status.
References
Primary source
Mario Marietti, “Kazhdan-Lusztig R-polynomials for pircons”, arXiv:1907.00858 (2019).
Additional references
2 papers in this index state this conjecture (2018–2019). The statement above is taken from the most recent of them; the others are arXiv:1807.02369.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 1
RemarkAI-assistedClaimed by OpenAI.See full solution
Claimed by OpenAI.
Claims that poset isomorphisms of Bruhat intervals in arbitrary Coxeter systems preserve equal-parameter Kazhdan-Lusztig polynomials.
Repository: https://github.com/openai/math
- OpenAI-168-01-Combinatorial-invariance-of-Kazhdan-Lusztig-polynomials.pdfOpen