Browse › Combinatorics › 168 Combinatorial invariance of Kazhdan–Lusztig polynomials
Combinatorial invariance of Kazhdan–Lusztig polynomials
Open PDFCite Report a problem Add a reference or comment Interested in working on this Start a discussion
Edit NOTES.md · Existing issues · Source on GitHub
Abstract
We prove that an isomorphism of Bruhat intervals in arbitrary Coxeter systems preserves their equal-parameter Kazhdan–Lusztig polynomials. This resolves the full combinatorial invariance conjecture positively.
If the PDF does not display here, open it directly: Open PDF.
Notes
No notes yet. Add a reference, a comment or your name with the buttons above, or edit NOTES.md on GitHub.
Automatically collected notes (unreviewed)
work in progress
Collected automatically by AI tools (Claude Opus 5.5 and GPT-6 Astra, 2026-10-21) and not checked by a person. May be wrong or incomplete. Report an error.
Follow-up works
- F. Caselli and M. Marietti, A simple classification of the special matchings in the symmetric group (arXiv:2610.21647, 15 Oct 2026). Gives a combinatorial algorithm for Kazhdan–Lusztig polynomials on an isomorphism-closed family of type-A Bruhat intervals; its Remark 1.2 cites this manuscript as [28] and notes that it "claims to prove the Combinatorial Invariance Conjecture".
- Nicolás Libedinsky, Polytopal invariance for Lusztig’s q-weight multiplicities (arXiv:2610.14275v1, 2026-10-09). Cites the OpenAI manuscript as an announced proof, establishes a metric spherical analogue, and proposes in §6.1 a conjecture connecting polytope isometries to Bruhat interval isomorphisms; the AI-use disclosure describes an AI-produced initial argument subsequently corrected and expanded by the author.
Formalization
- OpenAI, Combinatorial invariance of Kazhdan–Lusztig polynomials: Lean scope note (OpenAI math release, 2026-10-06). States that the formalization proves that every order isomorphism between Bruhat intervals in arbitrary, possibly different Coxeter systems preserves the equal-parameter Kazhdan–Lusztig polynomial, and links the comparator statement
KLInvariance.lean. - OpenAI math release, comparator statement
KLInvariance.lean(release Lean comparator challenge, 2026). Statement-only file: theoremcombinatorial_invariancetakes an order isomorphismInterval cs u b ≃o Interval cs' u' b'and concludesklPolynomial cs u b = klPolynomial cs' u' b'. - OpenAI math release,
Invariance.lean(release Lean development, 2026). Contains the proof ofKLInvariance.combinatorial_invariance, which importsOAI.RepresentationTheory.KazhdanLusztig.SimultaneousInvariance.
Possibly relevant literature (found by the agent, not checked)
- G. Burrull, N. Libedinsky, and D. Plaza, Combinatorial invariance conjecture for $\widetilde{A}_2$ (arXiv:2105.04609, 2021; IMRN, doi:10.1093/imrn/rnac105). Proves the conjecture for the affine Weyl group $\widetilde{A}_2$, a previously known infinite case of the statement the paper says includes infinite groups.
- G. T. Barkley and C. Gaetz, On combinatorial invariance of parabolic Kazhdan–Lusztig polynomials (arXiv:2404.04246, 2024; Selecta Math. 31 (2025), 51). Shows that the Lusztig–Dyer conjecture is equivalent to Marietti's parabolic analogue and a refined parabolic version, which bears on what Theorem 1.1 would imply in the parabolic setting.
- F. Esposito and M. Marietti, Flipclasses and Combinatorial Invariance for Kazhdan–Lusztig polynomials (arXiv:2402.13097, 2024). Introduces the flipclass approach that the introduction cites only through the later Esposito–Marietti–Stella paper.
- F. Esposito, M. Marietti, G. T. Barkley, and C. Gaetz, A note on Combinatorial Invariance of Kazhdan–Lusztig polynomials (arXiv:2404.12834, 2024). Formulates a hypercube-decomposition conjecture that implies type-A combinatorial invariance, related to the hypercube approach surveyed in the introduction.
Elsewhere
- VibeMathed: Problem record
- Emergent Mind: family 168
Independent sites; their content is not reviewed here.
Cite
@misc{OAI:Combinatorial-Invariance-of-Kazhdan-Lusztig-Polynomials-September-24-2026,
author = {{OpenAI}},
title = {{Combinatorial invariance of Kazhdan--Lusztig polynomials}},
howpublished = {OpenAI Math Release preprint
\href{https://github.com/openai/math/blob/main/preprints/Combinatorial-Invariance-of-Kazhdan-Lusztig-Polynomials-September-24-2026/paper.pdf}{OAI:Combinatorial-Invariance-of-Kazhdan-Lusztig-Polynomials-September-24-2026}},
year = {2026}
}Lean formalization
OpenAI provides Lean files for this family: lean/docs/168.md. The Lean statements have not been checked by people against the paper's claims.
Family 168: Combinatorial invariance of Kazhdan–Lusztig polynomials
Resolves the full combinatorial invariance conjecture: isomorphic Bruhat intervals in arbitrary Coxeter systems have identical equal-parameter Kazhdan–Lusztig polynomials. Thus the abstract order of the interval determines the polynomial, even across different Coxeter systems.
This is the only paper in this family.