“…Indeed, thanks to a result of Stembridge's in [20], W contains finitely many fully commutative elements if G is any other graph from Figure 1, so W must be a(2)-finite in these cases. It will be easy to show that W is a(2)-finite when G = I 2 (∞), and the case G =C n will also be easy thanks to a result of Ernst from [7] on the Temperley-Lieb algebra of typeC n , therefore the only case requiring more work is G = E q,r where min(q, r) ≥ 3. We will prove W is a(2)-finite in this case via a series of lemmas in Section 4.2, using arguments that involve heaps.…”