Cyclic Shuffle-Compatibility Via Cyclic Shuffle Algebras

Abstract

A permutation statistic \({{\,\textrm{st}\,}}\) is said to be shuffle-compatible if the distribution of \({{\,\textrm{st}\,}}\) over the set of shuffles of two disjoint permutations \(\pi \) and \(\sigma \) depends only on \({{\,\textrm{st}\,}}\pi \), \({{\,\textrm{st}\,}}\sigma \), and the lengths of \(\pi \) and \(\sigma \). Shuffle-compatibility is implicit in Stanley’s early work on P-partitions, and was first explicitly studied by Gessel and Zhuang, who developed an algebraic framework for shuffle-compatibility centered around their notion of the shuffle algebra of a shuffle-compatible statistic. For a family of statistics called descent statistics, these shuffle algebras are isomorphic to quotients of the algebra of quasisymmetric functions. Recently, Domagalski, Liang, Minnich, Sagan, Schmidt, and Sietsema defined a version of shuffle-compatibility for statistics on cyclic permutations, and studied cyclic shuffle-compatibility through purely combinatorial means. In this paper, we define the cyclic shuffle algebra of a cyclic shuffle-compatible statistic, and develop an algebraic framework for cyclic shuffle-compatibility in which the role of quasisymmetric functions is replaced by the cyclic quasisymmetric functions recently introduced by Adin, Gessel, Reiner, and Roichman. We use our theory to provide explicit descriptions for the cyclic shuffle algebras of various cyclic permutation statistics, which in turn gives algebraic proofs for their cyclic shuffle-compatibility.