The forgotten monoid

zbMath1175.05142arXiv0706.2996MaRDI QIDQ3533333

Jean-Christophe Novelli, Anne Schilling

Publication date: 23 October 2008

Full work available at URL: https://arxiv.org/abs/0706.2996

zbMATH Keywords

symmetric groupquasi-symmetric functionsinversion numbersforgotten monoidribbon-Schur functions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Symmetric functions and generalizations (05E05) Representations of finite symmetric groups (20C30)

Related Items (8)

What makes a \(\mathbf D_0\) graph Schur positive? ⋮ New results on families of pattern-replacement equivalences ⋮ Counting permutations modulo pattern-replacement equivalences for three-letter patterns ⋮ Equivalence classes of permutations modulo replacements between 123 and two-integer patterns ⋮ Rules of three for commutation relations ⋮ Noncommutative Schur functions, switchboards, and Schur positivity ⋮ Counting the Nontrivial Equivalence Classes of $S_n$ under $\{1234,3412\}$-Pattern-Replacement ⋮ From Hertzsprung's problem to pattern-rewriting systems

This page was built for publication: The forgotten monoid