the ``shuffle conjecture'' states that the bigraded frobeneus characteristic of the space of diagonal harmonics (equal to \(\nabla e_n\)) can be computed as the weighted sum of combinatorial objects called parking functions. in a 2010 paper haglund, morse, and zabrocki studied the family of polynomials \(\nabla c_{p_1}\dots c_{p_k}1\), where $p=(p_1,\ldots ,p_k)$ is a composition and the $c_a$ are certain rescaled hall-littlewood vertex operators. they conjecture that these polynomials enumerate a composition indexed family of parking functions weighted by the same statistics. this refinement of the nearly decade old ``shuffle conjecture,'' when combined with properties of the hall-littlewood polynomials implies the existence of certain bijections between these families of parking functions. the existence of these bijections then follows from some relatively simple properties of a certain recursively constructed family of polynomials. this work introduces those polynomials, explains their connection to the conjecture of haglund, morse, and zabrocki, and explores some of their surprising properties, both proven and conjectured. the result is an intriguing new approach to the shuffle conjecture and a deeper understanding of some classical parking function statistics.