  We first give a combinatorial proof of Stanley's shuffle theorem by using the
insertion lemma of Haglund, Loehr and Remmel. Based on this combinatorial
construction, we establish several refinements of Stanley's shuffle theorem.
