The symmetric group given by a Gröbner basis (Q2502924)

Let \(S_n\) denote the symmetric group of degree \(n\), and let \(S \subset S_n\) be the subset determined by \(\{s_1,\ldots,s_{n-1}\}\), where \(s_i = (i,i+1)\). Let \(\rho\) be the congruence on \(S_n\) determined by \(S\). In particular, there is an isomorphism between \(\langle x_1,\ldots,x_{n-1} \rangle/\rho\) and the monoid \(S_n\) given by \(x_i \rightarrow s_i\). Let \(<\) be the elimination order defined by: \(x_1 < \cdots < x_{n-1}\), and \(u < v\) (for \(u,v \in \langle X \rangle\)) if \(\deg_{x_i}u < \deg_{x_i}v\) (where \(i\) is the highest number such that the degrees aren't equal), or all degrees are equal, but \(u\) is smaller than \(v\) lexicographically. The authors give explicit formulae for the \(n(n-3)+3\) elements of the Gröbner basis of \(\text{Ideal}(P(\rho))\) with respect to \(<\). The basis they give is in fact a strong generating set. Further, they exhibit \(n!\) canonical words (words irreducible modulo the leading terms of the given generators), showing that there is a bijection between permutations \(\sigma\) and monomials \(m\) ``under the escalier''.