The forgotten monoid
From MaRDI portal
Abstract: We study properties of the forgotten monoid which appeared in work of Lascoux and Schutzenberger and recently resurfaced in the construction of dual equivalence graphs by Assaf. In particular, we provide an explicit characterization of the forgotten classes in terms of inversion numbers and show that there are n^2-3n+4 forgotten classes in the symmetric group S_n. Each forgotten class contains a canonical element that can be characterized by pattern avoidance. We also show that the sum of Gessel's quasi-symmetric functions over a forgotten class is a 0-1 sum of ribbon-Schur functions.
Recommendations
Cited in
(8)- Rules of three for commutation relations
- From Hertzsprung's problem to pattern-rewriting systems
- New results on families of pattern-replacement equivalences
- What makes a \(\mathbf D_0\) graph Schur positive?
- Counting permutations modulo pattern-replacement equivalences for three-letter patterns
- Equivalence classes of permutations modulo replacements between 123 and two-integer patterns
- Noncommutative Schur functions, switchboards, and Schur positivity
- Counting the nontrivial equivalence classes of \(S_n\) under \(\{1234, 3412\}\)-pattern-replacement
This page was built for publication: The forgotten monoid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533333)