Length enumeration of fully commutative elements in finite and affine Coxeter groups (Q1786472): Difference between revisions

Let \(W\) be a Coxeter group. An element \(w\in W\) is said to be \textit{fully commutative} if any reduced expression of \(w\) can be obtained from any other by a sequence of transpositions of adjacent commuting generators. Motivated by the combinatorics of 321-avoiding permutations, this paper focuses on the enumeration of these elements producing generating functions for these. Their formula in the case of type \(A\) was already known [\textit{E. Barcucci} et al., Discrete Math. 234, No. 1--3, 1--15 (2001; Zbl 0992.05003)] and a less elegant formular in the case of \(\tilde{A}\) has also previously appeared in the literature [\textit{C. R. H. Hanusa} and \textit{B. C. Jones}, Eur. J. Comb. 31, No. 5, 1342--1359 (2010; Zbl 1230.05028)]. The formulae obtained in the cases of types \(B\), \(C\) and \(D\) and their affine analogues are also obtained but are more complicated. The proofs of these results rely on a particular kind of poset called a \textit{heap} that reduces many of the calculations to the manipulation of diagramatic representations.