Search arXivSearch

arXiv · 2207.06264

Congruences for $k$-elongated plane partition diamonds

Abstract

In the eleventh paper in the series on MacMahons partition analysis, Andrews and Paule [1] introduced the $k$ elongated partition diamonds. Recently, they [2] revisited the topic. Let $d_k(n)$ count the partitions obtained by adding the links of the $k$ elongated plane partition diamonds of length $n$. Andrews and Paule [2] obtained several generating functions and congruences for $d_1(n)$, $d_2(n)$, and $d_3(n)$. They also posed some conjectures, among which the most difficult one was recently proved by Smoot [11]. Da Silva, Hirschhorn, and Sellers [5] further found many congruences modulo certain primes for $d_k(n)$ whereas Li and Yee [8] studied the combinatorics of Schmidt type partitions, which can be viewed as partition diamonds. In this article, we give elementary proofs of the remaining conjectures of Andrews and Paule [2], extend some individual congruences found by Andrews and Paule [2] and da Silva, Hirschhorn, and Sellers [5] to their respective families as well as find new families of congruences for $d_k(n)$, present a refinement in an existence result for congruences of $d_k(n)$ found by da Silva, Hirschhorn, and Sellers [5], and prove some new individual as well as a few families of congruences modulo 5, 7, 8, 11, 13, 16, 17, 19, 23, 25, 32, 49, 64 and 128.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nayandeep Deka Baruah, Hirakjyoti Das, Pranjal Talukdar. 2022-07-13. Congruences for $k$-elongated plane partition diamonds. https://arxiv.org/abs/2207.06264

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT