A bijective proof of the generating function for the number of reverse plane partitions via lattice paths

Recently, Hillman and Grassl gave a bijective proof for the generating function for the number of reverse plane partitions of a fixed shape λ. We give another bijective proof for this generating function via completelv different methods. Our bijection depends on a lattice path coding of reverse plane partitions and a new method for constructing bisections out of certain pairs of involutions due to Garsia and Milne.