A proof of the -square conjecture

We prove a combinatorial formula conjectured by Loehr and Warrington for the coefficient of the sign character in ∇ ( p n ) . Here ∇ denotes the Bergeron–Garsia nabla operator, and p n is a power-sum symmetric function. The combinatorial formula enumerates lattice paths in an n × n square according to two suitable statistics.