d-fold partition diamonds

In this work we introduce new combinatorial objects called d–fold partition diamonds, which generalize both the classical partition function and the partition diamonds of Andrews, Paule and Riese, and we set r_d(n) to be their counting function. We also consider the Schmidt type d–fold partition diamonds, which have counting function s_d(n). Using partition analysis, we then find the generating function for both, and connect the generating functions ∑_n=0^∞s_d(n)qⁿ to Eulerian polynomials. This allows us to develop elementary proofs of infinitely many Ramanujan–like congruences satisfied by s_d(n) for various values of d, including the following family: for all d≥1 and all n≥0, s_d(2n+1)≡0(mod2^d).