Brenti's conjecture on special matchings and Kazhdan–Lusztig RR-polynomials

Let WW be a Coxeter group of type AA, let u,v∈Wu,v\in W, and let MM be a special matching of the Bruhat interval [u,v][u,v]. For x,y∈[u,v]x,y\in [u,v] with x≤yx\le y, write Rx,y(q)R_{x,y}(q) for the Kazhdan–Lusztig RR-polynomial. Brenti's conjecture. For all such x,yx,y, one has

Rx,y(q)={RM(x),M(y)(q)if⁡M(x)⊲x, M(y)⊲y,RM(x),M(y)(q)if⁡M(x)⊳x, M(y)⊳y,(q−1)Rx,M(y)(q)+qRM(x),M(y)(q)if⁡M(x)⊳x, M(y)⊲y,q−1RM(x),M(y)(q)+(q−1−1)RM(x),y(q)if⁡M(x)⊲x, M(y)⊳y.R_{x,y}(q)=\begin{cases} R_{M(x),M(y)}(q) & \operatorname{if } M(x)\lhd x,\ M(y)\lhd y,\\ R_{M(x),M(y)}(q) & \operatorname{if } M(x)\rhd x,\ M(y)\rhd y,\\ (q-1)R_{x,M(y)}(q)+qR_{M(x),M(y)}(q) & \operatorname{if } M(x)\rhd x,\ M(y)\lhd y,\\ q^{-1}R_{M(x),M(y)}(q)+(q^{-1}-1)R_{M(x),y}(q) & \operatorname{if } M(x)\lhd x,\ M(y)\rhd y. \end{cases}

The conjecture extends Brenti's result for intervals starting from the identity to arbitrary Bruhat intervals in type AA. The paper's abstract says that this conjecture is proved, so its status is recorded as solved; the displayed assertion is retained as the source statement.

References

Primary source

Fabrizio Caselli and Mario Marietti, “Special Matchings, Brenti's Conjecture, and the Combinatorial Invariance Conjecture”, arXiv:2606.11776 (2026).

Progress summary

Refreshed
Claimed solved

A June 2026 preprint claims to prove the conjecture for every type-A Bruhat interval, but the proof has not been independently verified.

Brenti’s 2003 conjecture extends the known identity-starting recursion for Kazhdan–Lusztig RR-polynomials to arbitrary Bruhat intervals in type AA. It prescribes four formulas according to whether a special matching moves each endpoint up or down.

Known results

  • Lower Bruhat intervals were explicitly characterized and classified, with applications to parabolic Kazhdan–Lusztig polynomials (2016).
  • For special matchings of [e,w][e,w], recursive formulas for Ru,w(q)R_{u,w}(q) were established (2017), covering the identity-starting case.

June 2026 claimed proof

The preprint Special Matchings, Brenti's Conjecture, and the Combinatorial Invariance Conjecture claims a complete classification of special matchings on arbitrary type-AA Bruhat intervals and derives Brenti’s conjecture for all x,yin[u,v]x,yin [u,v] with x≤yx\le y. It does not claim to prove the broader Combinatorial Invariance Conjecture, which it presents as still open.

Current status (as of September 2026): Brenti’s conjecture is claimed proved by the June 2026 preprint, but that proof remains unverified; the broader Combinatorial Invariance Conjecture remains open.

Sources

Solutions 0

No solutions have been posted yet.