Shuffle-compatibility for combinatorial statistics on words, parking functions, and set partitions
arXiv:2607.14255
The paper defines weak and shifted shuffle-compatibility for statistics on words, parking functions, and set partitions, extending previous work on permutations, and connects these concepts to combinatorial Hopf algebras such as QSym and FQSym.
Abstract
We introduce notions of (weak) shuffle-compatibility for statistics on words, parking functions, and set partitions, generalizing Gessel and Zhuang's shuffle-compatibility for statistics on permutations. For parking functions and set partitions, we perform a systematic review of statistics that appear in the FindStat database (as well as the literature). We further define (shifted) shuffle algebras of (weakly) shuffle-compatible statistics on the equivalence classes induced by the statistics. These algebras relate closely to various combinatorial Hopf algebras such as QSym, FQSym, PQSym, and NCSym. These constructions yield new combinatorial interpretations of various Hopf algebra bases and, in some cases, new bases entirely.
29 pages