A note on fully commutative elements in complex reflection groups (Q6080565)

Let \(G\) be a group generated by a set of elements \(\Gamma\), an element \(g \in G\) is fully commutative if all its reduced expressions in \(\Gamma\) can be obtained each from the other by interchanges of adjacent commuting generators (the definition, in general, depends on \(\Gamma\)). In various settings, fully commutative elements are characterized in different ways. In the symmetric group \(S_{n}\) generated by simple transpositions, fully commutative elements are permutations that avoid the pattern \(321\) (see [\textit{S. C. Billey} et al., J. Algebr. Comb. 2, No. 4, 345--374 (1993; Zbl 0790.05093)]). In the paper under review, the author shows that an element \(g\) in the Coxeter group \(G(m,1,n)\) is fully commutative if and only if the resulting element, after every nontrivial \(m\)-th root of unity in \(g\) is replaced with \(-1\), is fully commutative in \(B_{n}\). This implies that the pattern avoidance of fully commutative elements in \(B_{n}\) extends to \(G(m,1,n)\). As a consequence, the author proves that the enumeration of fully commutative elements in \(G(m,1,n)\) can be achieved by counting fully commutative elements in \(B_{n}\) by the number of \(-1\)'s in their matrix forms. Further, the author discusses why fully commutative elements in \(G(m,m,n)\) do not have the pattern avoidance property.