Speaker：Qing Ji (Tianjin University)

Time：2025-11-28 16:00

Location：Conference Room S102 at Experiment Building at Haiyun Campus

Abstract:

Stanley's shuffle theorem was first established by R.P. Stanley (ICM, plenary speaker) in his foundational work on P-partitions (Mem. Amer. Math. Soc., 1972 ). As noted by Gessel and Zhuang, this theorem implies that the major index (maj) and descent number (des) are shuffle compatible, which has motivated several recent works. Recently, we have provided a new bijective proof of this theorem, resolving an open problem originally posed by Stanley. Building on this bijection, we have further developed several refinements of the theorem. In this talk, we will present these new refinements and discuss two applications of Stanley’s Shuffle Theorem.