Search arXivSearch

arXiv · 1304.0661

Ramanujan-type Congruences for Broken 2-Diamond Partitions Modulo 3

Abstract

The notion of broken $k$-diamond partitions was introduced by Andrews and Paule. Let $Δ_k(n)$ denote the number of broken k-diamond partitions of $n$. They also posed three conjectures on the congruences of $Δ_2(n)$ modulo 2, 5 and 25. Hirschhorn and sellers proved the conjectures for modulo 2, and Chan proved cases of modulo 5. For the case of modulo 3, Radu and Sellers obtained an infinite family of congruences for $Δ_2(n)$. In this paper, we obtain two infinite families of congruences for $Δ_2(n)$ modulo 3 based on a formula of Radu and Sellers, the 3-dissection formula of the generating function of triangular number due to Berndt, and the properties of the $U$-operator, the $V$-operator, the Hecke operator and the Hecke eigenform. For example, we find that $Δ_2(243n+142)\equiv Δ_2(243n+223)\equiv0\pmod{3}$. The infinite family of Radu and Sellers and the two infinite families derived in this paper have two congruences in common, namely, $Δ_2(27n+16)\equivΔ_2(27n+25)\equiv0 \pmod{3}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

William Y. C. Chen, Anna R. B. Fan, Rebecca T. Yu. 2013-04-02. Ramanujan-type Congruences for Broken 2-Diamond Partitions Modulo 3. https://doi.org/10.1007/s11425-014-4846-7

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO