English
Related papers

Related papers: Congruences and recursions for the cubic partition

200 papers

Let $T_\ell(n)$ denote the number of $\ell-$regular partition triples of $n$ and let $p_{\ell, 3}(n)$ enumerates the number of 2--color partition triples of $n$ where one of the colors appear only in parts that are multiples of $\ell$. In…

Combinatorics · Mathematics 2025-04-21 B. Hemanthkumar , D. S. Gireesh

The solvability of the cubic congruence $x^{3}\equiv 2\pmod{p}$ is referred to as the $\textit{cubic character of 2}$. In evaluating the cubic character of 2, we introduce the Eisenstein integers, Gauss and Jacobi sums, and the law of cubic…

Number Theory · Mathematics 2026-02-03 Matias C. Relyea

Let $p_k(n)$ be given by the $k$-th power of the Euler Product $\prod _{n=1}^{\infty}(1-q^n)^k=\sum_{n=0}^{\infty}p_k(n)q^{n}$. By investigating the properties of the modular equations of the second and the third order under the Atkin…

Combinatorics · Mathematics 2018-03-14 Julia Q. D. Du , Edward Y. S. Liu , Jack C. D. Zhao

In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

Combinatorics · Mathematics 2020-05-08 Mircea Merca

Recently Lachterman, Schayer, and Younger published an elegant proof of the Ramanujan congruences for the partition function $p(n)$. Their proof uses only the classical theory of modular forms as well as a beautiful result of Choie, Kohnen,…

Number Theory · Mathematics 2016-01-21 Oleg Lazarev , Matthew S. Mizuhara , Benjamin Reid , Holly Swisher

In this article we exhibit new explicit families of congruences for the overpartition function, making effective the existence results given previously by Treneer. We give infinite families of congruences modulo $m$ for $m = 5, 7, 11$, and…

Number Theory · Mathematics 2024-10-16 Nathan C. Ryan , Nicolás Sirolli , Jean Carlos Villegas-Morales , Qi-Yang Zheng

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

Combinatorics · Mathematics 2015-10-01 William Y. C. Chen , Qing-Hu Hou , Doron Zeilberger

Concave compositions are ordered partitions whose parts are decreasing towards a central part. We study the distribution modulo $a$ of the number of concave compositions. Let $c(n)$ be the number of concave compositions of $n$ having even…

Number Theory · Mathematics 2014-07-07 Keenan Monks , Lynnelle Ye

By finding the congruent relations between the generating function of the 5 dots bracelet partitions and that of the 5-regular partitions, we get some new congruences modulo 2 for the 5 dots bracelet partition function. Moreover, for a…

Number Theory · Mathematics 2013-03-21 Suping Cui , Nancy S. S. Gu

We establish estimates for the number of solutions of certain affine congruences. These estimates are then used to prove Manin's conjecture for a cubic surface split over Q and whose singularity type is D_4. This improves on a result of…

Number Theory · Mathematics 2016-01-20 Pierre Le Boudec

Almost nothing is known about the parity of the partition function $p(n)$, which is conjectured to be random. Despite this expectation, Ono surprisingly proved the existence of infinitely many linear dependence congruence relations modulo 4…

Number Theory · Mathematics 2024-12-24 Steven Charlton

It is widely believed that the parity of the partition function $p(n)$ is ``random.'' Contrary to this expectation, in this note we prove the existence of infinitely many congruence relations modulo 4 among its values. For each square-free…

Number Theory · Mathematics 2022-12-15 Ken Ono

Let $p_{k}(n)$ be the coefficient of $q^n$ in the series expansion of $(q;q)_{\infty}^{k}$. It is known that the partition function $p(n)$, which corresponds to the case when $k=-1$, satisfies congruences such as $p(5n+4)\equiv 0\pmod{5}$.…

Number Theory · Mathematics 2018-04-11 Heng Huat Chan , Liuquan Wang

Using quasimodular forms with respect to $\Gamma_0(4)$ we find exact relations between the M2-rank for partitions without repeated odd parts and three residual cranks. From these identities we are able to deduce various congruences mod 3…

Number Theory · Mathematics 2014-08-22 Chris Jennings-Shaffer

Let spt(n) denote the total number of appearances of smallest parts in the partitions of n. Recently, Andrews showed how spt(n) is related to the second rank moment, and proved some surprising Ramanujan-type congruences mod 5, 7 and 13. We…

Number Theory · Mathematics 2008-06-11 F. G. Garvan

In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…

Number Theory · Mathematics 2018-02-02 Giuseppe Fera , Vittorino Talamini

Let $p(n)$ denote the partition function. In this article, we will show that congruences of the form $$ p(m^j\ell^kn+B)\equiv 0\mod m \text{for all} n\ge 0 $$ exist for all primes $m$ and $\ell$ satisfying $m\ge 13$ and $\ell\neq 2,3,m$.…

Number Theory · Mathematics 2009-04-17 Yifan Yang

For a given prime $p$, we study the properties of the $p$-dissection identities of Ramanujan's theta functions $\psi(q)$ and $f(-q)$, respectively. Then as applications, we find many infinite family of congruences modulo 2 for some…

Combinatorics · Mathematics 2013-02-18 Suping Cui , Nancy Shanshan Gu

We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. Our proof naturally leads to a formula for the number of partitions with a given parity of the smallest part, in terms of S(i), the number of…

Combinatorics · Mathematics 2022-05-13 Damanvir Singh Binner

By considering the $M_2$-rank of an overpartition as well as a residual crank, we give another combinatorial refinement of the congruences $\overline{\mbox{spt}}_2(3n)\equiv \overline{\mbox{spt}}_2(3n+1)\equiv 0\pmod{3}$. Here…

Number Theory · Mathematics 2014-06-23 Chris Jennings-Shaffer