Order structure on the algebra of permutations and of planar binary trees (Q1604770)

If \(X_n\) is either the symmetric group on \(n\) letters, the set of planar binary \(n\)-trees or the set of vertices of the \((n-1)\)-dimensional cube, then \(K[X_\infty]\) denotes the algebra \(\bigoplus_{n\geq 0} K[X_n]\), where the product on generators \(\sigma\) and \(\tau\) is denoted by \(\sigma*\tau\) and in each case can be written as \(\sigma *\tau= \sum\omega\), where \(\sigma/\tau\leq \omega\leq\sigma\setminus\tau\), the constructions varying for the different types although related in interesting ways via somewhat natural maps. On \(\sigma\in S_p\), \(\tau\in S_q\), \(\sigma/\tau= \sigma\times\tau\in S_{p+q}\) and \(\sigma\setminus\tau= \xi_{p,q}(\sigma\times \tau)\in S_{p+q}\) where \(\xi_{p,q}\) is the permutation whose image is \((q+1,\dots, q+p,1,2,\dots, q)\) and where \(\sigma/\tau\leq \sigma\setminus\tau\) in the weak Bruhat order for \(S_{p+q}\), permitting a simpler description of this product and thereby an `easier' analysis of the algebra \(K[S_\infty]\). On planar binary \(n\)-trees \(u\) and \(v\), \(u/v\) is the tree obtained by identifying the root of \(u\) with the leftmost leaf of \(v\), while \(u\setminus v\) is obtained by identifying the rightmost leaf of \(u\) with the root of \(v\), while the \((n-1)\)-cube order is the usual product order on the coordinates of the vertices. Again, this paper shows the tight intertwining of certain structures including graph theoretical ones with a cornucopia of algebraic structures each revealing in their own ways interesting properties not easily visible otherwise of which these studied here are one more useful example.