Bijective proofs of shuffle compatibility results

Abstract

Define a permutation to be any sequence of distinct positive integers. Given two permutations π and σ on disjoint underlying sets, we denote by π⧢σ the set of shuffles of π and σ (the set of all permutations obtained by interleaving the two permutations). A permutation statistic is a function St whose domain is the set of permutations such that St(π) only depends on the relative order of the elements of π. A permutation statistic is shuffle compatible if the distribution of St on π⧢σ depends only on St(π) and St(σ) and their lengths rather than on the individual permutations themselves. This notion is implicit in the work of Stanley in his theory of P-partitions. The definition was explicitly given by Gessel and Zhuang who proved that various permutation statistics were shuffle compatible using mainly algebraic means. This work was continued by Grinberg. The purpose of the present article is to use bijective techniques to give demonstrations of shuffle compatibility. In particular, we show how a large number of permutation statistics can be shown to be shuffle compatible using a few simple bijections. Our approach also leads to a method for constructing such bijective proofs rather than having to treat each one in an ad hoc manner. Finally, we are able to prove a conjecture of Gessel and Zhuang about the shuffle compatibility of a particular statistic.