Related papers: Exact formula for cubic partitions
The notion of cubic partitions is introduced by Hei-Chi Chan and named by Byungchan Kim in connection with Ramanujan's cubic continued fractions. Chan proved that cubic partition function has Ramanujan Type congruences modulo powers of $3$.…
A new recursive procedure for calculation of restricted partition function is suggested. An explicit formula for the restricted partition function is found based on this procedure.
We obtain congruences for the number a(n) of cubic partitions using modular forms. The notion of cubic partitions is introduced by Chan and named by Kim in connection with Ramanujan's cubic continued fractions. Chan has shown that a(n) has…
Let $b(n)$ denote the number of cubic partition pairs of $n$. In this paper, we aim to provide a strategy to obtain arithmetic properties of $b(n)$. This gives affirmative answers to two of Lin's conjectures.
In this paper we explore Kruyswijk's method and show how to obtain congruences for cubic partition. That apart we also examine inequalities for a(n) and provide upper bound for it in the fashion of the classic partition function p(n).
We prove several congruences satisfied by the generalized cubic and generalized overcubic partition functions, recently introduced by Amdeberhan, Sellers, and Singh. We also prove infinite families of congruences modulo powers of $2$ and…
In this short note, we prove several new congruences for the overcubic partition triples function, using both elementary techniques and the theory of modular forms. These extend the recent list of such congruences given by Nayaka,…
Recently Amdeberhan, Sellers, and Singh introduced a new infinite family of partition functions called generalized cubic partitions. Given a positive integer $d$, they let $a_d(n)$ be the counting function for partitions of $n$ in which the…
In 1918, Hardy and Ramanujan made a breakthrough by developing the circle method to deduce an asymptotic formula for the partition function $p(n)$, which was later refined by Rademacher in 1937 to produce an absolutely convergent series…
Let $A_{3}(n)$ (resp. ${{B}_{3}}(n)$) denote the number of partition pairs (resp. triples) of $n$ where each partition is 3-core. By applying Ramanujan's ${}_{1}\psi_{1}$ formula and Bailey's ${}_{6}\psi_{6}$ formula, we find the explicit…
Recently, Amdeberhan, Sellers, and Singh introduced the notion of a generalized cubic partition function $a_c(n)$ and proved two isolated congruences via modular forms, namely, $a_3(7n+4)\equiv 0\pmod{7}$ and $a_5(11n+10)\equiv 0\pmod{11}$.…
The partition function $p(n)$ has been a testing ground for applications of analytic number theory to combinatorics. In particular, Hardy and Ramanujan invented the "circle method" to estimate the size of $p(n)$, which was later perfected…
A cubic partition consists of partition pairs $(\lambda,\mu)$ such that $\vert\lambda\vert+\vert\mu\vert=n$ where $\mu$ involves only even integers but no restriction is placed on $\lambda$. This paper initiates the notion of generalized…
In this paper, we derive certain congruences for the number of $3$-core cubic bipartitions using elementary $q$-series manipulations and dissection formulas.
Recently, Andrews, Hirschhorn and Sellers have proven congruences modulo 3 for four types of partitions using elementary series manipulations. In this paper, we generalize their congruences using arithmetic properties of certain quadratic…
In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…
This is an elementary explanation of a cubic composition formula due to Ramanujan.
A cubic partition is an integer partition wherein the even parts can appear in two colors. In this paper, we introduce the notion of generalized cubic partitions and prove a number of new congruences akin to the classical Ramanujan-type. We…
Fourier expansion of the integrand in the path integral formula for the partition function of quantum systems leads to a deterministic expression which, though still quite complex, is easier to process than the original functional integral.…
We present a conjecture about partitions, with a very elementary formulation.