The Setting
Let be a Coxeter system with length function and set of reflections . The combinatorial invariance conjecture asks that for elements of in the Bruhat order, the Kazhdan-Lusztig polynomial depend only on the Bruhat interval as a partially ordered set. Dyer’s path formula writes the normalized R-polynomial as a sum over the paths from to in the Bruhat graph, whose edges are defined below, that have labels increasing in a reflection order; so it reads the Bruhat graph of the interval and not only its order.
For elements of , the covers of the interval , the pairs its Hasse diagram draws, are the edges of the Bruhat graph, defined in the next section, with . Other edges join elements farther apart: in the symmetric group with simple reflections and , the identity is joined to the reflection , of length three. The question is whether the partially ordered set determines its whole Bruhat graph: whether an order isomorphism from onto an interval of a second Coxeter system carries edges to edges and non-edges to non-edges.
Edges, Intervals and the Diamond Rule
An upward edge of the Bruhat graph of is a pair of elements of such that (1)✦ it is labelled by the reflection . The Bruhat order on is the reflexive transitive closure of the edge relation (1).✦
For elements of , the Bruhat interval is the set of those with , ordered by the Bruhat order.✦ An order isomorphism onto an interval of a second Coxeter system is a bijection such that if and only if .
A cover in a partially ordered set is a pair of elements with and no element of strictly between them. The diamond edge closure of a partially ordered set is the smallest relation on that contains every cover and obeys the diamond rule: for in with and , (2)✦
The Claim
Theorem 1. Let be a Coxeter system of finite rank. If are elements of with and , and , and are edges of the Bruhat graph for all , then (3)✦ If is an edge of the Bruhat graph with , there are elements and of such that (4)✦ Without the finite rank hypothesis, for of arbitrary rank, elements of and an edge with and in , (5)✦ Let be a second Coxeter system, elements of and an order isomorphism. If both and have finite rank, then for all (6)✦ and for and of arbitrary rank, for all , (7)✦
What Is Checked
The claims are stated over the edges (1) of the Bruhat graph of a Coxeter system, of finite rank in (3) and (4), with both systems of finite rank in (6), and of arbitrary rank in (5) and (7), the Bruhat order they generate, the intervals with their induced order and the order isomorphisms between them, and the diamond edge closure (2) of a partially ordered set.