DMTCS Proceedings, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)

Font Size:  Small  Medium  Large

Connections Between a Family of Recursive Polynomials and Parking Function Theory

Angela Hicks


In a 2010 paper Haglund, Morse, and Zabrocki studied the family of polynomials ∇Cp1…Cpk1 , where p=(p1,…,pk) is a composition, ∇ is the Bergeron-Garsia Macdonald operator and the Ca are certain slightly modified Hall-Littlewood vertex operators. They conjecture that these polynomials enumerate a composition indexed family of parking functions by area, dinv and an appropriate quasi-symmetric function. This refinement of the nearly decade old ``Shuffle Conjecture,'' when combined with properties of the Hall-Littlewood operators can be shown to imply the existence of certain bijections between these families of parking functions. In previous work to appear in her PhD thesis, the author has shown that the existence of these bijections follows from some relatively simple properties of a certain family of polynomials in one variable x with coefficients in [q]. In this paper we introduce those polynomials, explain their connection to the conjecture of Haglund, Morse, and Zabrocki, and explore some of their surprising properties, both proven and conjectured.

Full Text: PostScript PDF

Valid XHTML 1.0 Transitional