Discrete Mathematics & Theoretical Computer Science |

3027

- 1 Department of Mathematics [Univ California San Diego]

In a recent paper, Duane, Garsia, and Zabrocki introduced a new statistic, "ndinv'', on a family of parking functions. The definition was guided by a recursion satisfied by the polynomial $\langle\Delta_{h_m}C_p1C_p2...C_{pk}1,e_n\rangle$, for $\Delta_{h_m}$ a Macdonald eigenoperator, $C_{p_i}$ a modified Hall-Littlewood operator and $(p_1,p_2,\dots ,p_k)$ a composition of n. Using their new statistics, they are able to give a new interpretation for the polynomial $\langle\nabla e_n, h_j h_n-j\rangle$ as a q,t numerator of parking functions by area and ndinv. We recall that in the shuffle conjecture, parking functions are q,t enumerated by area and diagonal inversion number (dinv). Since their definition is recursive, they pose the problem of obtaining a non recursive definition. We solved this problem by giving an explicit formula for ndinv similar to the classical definition of dinv. In this paper, we describe the work we did to construct this formula and to prove that the resulting ndinv is the same as the one recursively defined by Duane, Garsia, and Zabrocki.

Source: HAL:hal-01283140v1

Volume: DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)

Section: Proceedings

Published on: January 1, 2012

Imported on: January 31, 2017

Keywords: Hall-Littlewood polynomials, dinv, shuffle conjecture,parking functions, diagonal inversions,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 169 times.

This article's PDF has been downloaded 153 times.