The Hilbert series of the Garsia-Haiman module can be defined combinatorially as generating functions of certain fillings of Ferrers diagrams. One of the challenges in working with the combinatorial definition is the large number of fillings needed to generate a polynomial. In this talk we look at combinatorial proof of some factorizations of the Hilbert series.