Partitions, motives and Hilbert schemes

Counting the number of higher dimensional partitions is a hard classical problem. Computing the motive of the Hilbert schemes of points is even harder. I will discuss some structural formulas for the generating series of both problems, their stabilisation properties when the dimension grows very large and how to apply all of this to obtain (infinite) new examples of motives of singular Hilbert schemes. This is joint work with M. Graffeo, R. Moschetti and A. Ricolfi.