Skip to content

Shuffle-Compatibility: From Linear to Cyclic 03/06/2023

This talk has been cancelled due to illness

Speaker: Yan Zhuang, Davidson
Date and time: Monday, March 6, 4–5 pm
Place: Rome 206

Abstract: A permutation statistic st is said to be shuffle-compatible if the distribution of st over the set of shuffles of two disjoint permutations π and σ depends only on st(π), st(σ), and the lengths of π and σ. This notion is implicit in Stanley’s work on P-partitions, and was first explicitly studied by Gessel and Zhuang in 2018, who developed a unifying framework for shuffle-compatibility in which quasisymmetric functions play an important role. Since then, shuffle-compatibility has become an active topic of research. The first half of my talk will give an overview of the theory of shuffle-compatibility from my joint work with Ira Gessel; the second half will focus on more recent work—joint with Jinting Liang and Bruce Sagan—on shuffle-compatibility of cyclic permutation statistics, in which the role played by quasisymmetric functions is replaced by the cyclic quasisymmetric functions introduced by Adin, Gessel, Reiner, and Roichman.