An explicit formula for ndinv, a new statistic for two-shuffle parking functions

In a recent paper, Duane, Garsia, and Zabrocki introduced a new statistic, “ndinv”, on a family of parking functions. The definition was guided by their study of a recursion on 〈 Δ h m C p 1 C p 2 … C p k 1 , e n 〉 for Δ h m a Macdonald eigenoperator, C p i a modified Hall–Littlewood operator, and ( p 1 , p 2 , … , p k ) a composition of n. Using their newly introduced statistic, one can give a new interpretation for 〈 ∇ e n , h j h n − j 〉 as a sum of parking functions q , t counted by area and ndinv. This is a departure from the traditional sum, as stated by the shuffle conjecture, which q, t counts area and diagonal inversion number (dinv). Since their definition is necessarily recursive, they pose the problem of obtaining a non-recursive definition. In this paper, we solve this problem by giving an explicit formula for ndinv similar to the classical definition of dinv and prove it is equivalent to the ndinv of Duane, Garsia, and Zabrocki.