Arithmetic identities for class regular partitions (Q1709228)

Given a list \(\underline{r}=(r_1,r_2,\dots r_m)\) of positive integers, we define the set of \(\underline{r}\)-class regular partitions to be partitions none of whose parts are divisible by any of \(r_1,\dots r_m\). We use \(\mathrm{CP}_{\underline{r},n}\) to denote the set of \(\underline{r}\)-class regular partitions of \(n\). In this note, the authors investigate arithmetic properties of the set \(\mathrm{CP}_{\underline{r},n}\), mostly related to products of the parts and multiplicities of the partitions in question. Some relevant generating functions are given, and the Glaisher correspondence is used to shed some light on the other formulas in the paper. Finally, the authors specialize to the case where \(m=1\) (the classical case of \(r\)-class regular partitions which arise naturally in the modular representation theory of the symmetric group.) The authors then use their results to give another proof of Olsson's formula for the determinant of the \(r\)-regular character table of \(S_n\). This proof uses symmetric polynomials as the main tool of the proof, following the suggestion of such a proof by \textit{C. Bessenrodt} et al. [J. Algebr. Comb. 21, No. 2, 163--177 (2005; Zbl 1062.05144)].