An m-ballot path of size n is a path on the square grid consisting of north and east unit steps, starting at (0, 0), ending at (m n, n), and never going below the line {. x = m y}. The set of these paths can be equipped with a lattice structure, called the m-Tamari lattice and denoted by Tn(m), which generalizes the usual Tamari lattice Tn obtained when m = 1. This lattice was introduced by F. Bergeron in connection with the study of diagonal coinvariant spaces in three sets of n variables. The representation of the symmetric group Sn on these spaces is conjectured to be closely related to the natural representation of Sn on (labeled) intervals of the m-Tamari lattice, which we study in this paper.An interval [. P, Q] of Tn(m) is labeled if the north steps of Q are labeled from 1 to n in such a way the labels increase along any sequence of consecutive north steps. The symmetric group Sn acts on labeled intervals of Tn(m) by permutation of the labels. We prove an explicit formula, conjectured by F. Bergeron and the third author, for the character of the associated representation of Sn. In particular, the dimension of the representation, that is, the number of labeled m-Tamari intervals of size n, is found to be. (m+1)n(mn+1)n-2. These results are new, even when m = 1.The form of these numbers suggests a connection with parking functions, but our proof is not bijective. The starting point is a recursive description of m-Tamari intervals. It yields an equation for an associated generating function, which is a refined version of the Frobenius series of the representation. This equation involves two additional variables x and y, a derivative with respect to y and iterated divided differences with respect to x. The hardest part of the proof consists in solving it, and we develop original techniques to do so, partly inspired by previous work on polynomial equations with "catalytic" variables. © 2013 Elsevier Inc.