English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In 2007, Andrews and Paule published the eleventh paper in their series onMacMahon's partition analysis, with a particular focus on broken $k$-diamondpartitions. On the way to broken $k$-diamond partitions, Andrews and Pauleintroduced the idea of $k$-elongated partition diamonds. Recently, Andrews andPaule revisited the topic of $k$-elongated partition diamonds. Using partitionanalysis and the Omega operator, they proved that the generating function forthe partition numbers $d_k(n)$ produced by summing the links of $k$-elongatedplane partition diamonds of length $n$ is given by$\frac{(q^2;q^2)_\infty^k}{(q;q)_\infty^{3k+1}}$ for each $k\geq 1.$ Asignificant portion of their recent paper involves proving several congruenceproperties satisfied by $d_1, d_2$ and $d_3$, using modular forms as theirprimary proof tool. In this work, our goal is to extend some of the resultsproven by Andrews and Paule in their recent paper by proving infinitely manycongruence properties satisfied by the functions $d_k$ for an infinite set ofvalues of $k.$ The proof techniques employed are all elementary, relying ongenerating function manipulations and classical $q$-series results.

Elementary Proofs of Infinitely Many Congruences for $k$-Elongated Partition Diamonds