English
Related papers

Related papers: A Rademacher Type Formula For Partitions and Overp…

200 papers

In this paper we develop a method to calculate the overpartition function efficiently using a Hardy-Rademacher-Ramanujan type formula, and we use this method to find many new Ramanujan-style congruences, whose existence is predicted by…

We apply Rademacher's method in order to compute the Fourier coefficients of a large class of $\eta$-quotients.

Number Theory · Mathematics 2017-10-27 Ethan Sussman

The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of $n$ is reviewed. Next, the steps for finding analogous formulas for certain restricted classes of partitions or overpartiitons is examined, bearing in…

Number Theory · Mathematics 2020-01-28 Andrew V. Sills

Let $p_{r,s}(n)$ denote the number of partitions of a positive integer $n$ into parts containing no multiples of $r$ or $s$, where $r>1$ and $s>1$ are square-free, relatively prime integers. We use classical methods to derive a…

Number Theory · Mathematics 2019-01-17 James Mc Laughlin , Scott Parsell

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…

Number Theory · Mathematics 2025-09-30 Archit Agarwal , Meghali Garg , Bibekananda Maji

In 1939, H. S. Zuckerman provided a Hardy-Ramanujan-Rademacher-type convergent series that can be used to compute an isolated value of the overpartition function $\overline{p}(n)$. Computing $\overline{p}(n)$ by this method requires…

Number Theory · Mathematics 2020-09-15 Mircea Merca

For a positive integer $n$, let $p(n)$ be the number of ways to express $n$ as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for $p(n)$ in a pedagogical way, with all the details…

Number Theory · Mathematics 2023-02-09 Ze-Yong Kong , Lee-Peng Teo

A Ramanujan-type formula involving the squares of odd zeta values is obtained. The crucial part in obtaining such a result is to conceive the correct analogue of the Eisenstein series involved in Ramanujan's formula for $\zeta(2m+1)$. The…

Number Theory · Mathematics 2019-01-30 Atul Dixit , Rajat Gupta

We describe how the Hardy-Ramanujan-Rademacher formula can be implemented to allow the partition function $p(n)$ to be computed with softly optimal complexity $O(n^{1/2+o(1)})$ and very little overhead. A new implementation based on these…

Number Theory · Mathematics 2019-02-20 Fredrik Johansson

The Fourier coefficients of a negative weight eta-quotient, in many particular cases, and after Sussman in general, are known to be expressible by Hardy-Ramanujan-Rademacher type series. We show that the central terms of the coefficients of…

This note rederives a formula for $r$-color partitions, $1 \le r \le 24$, including Rademacher's celebrated result for ordinary partitions, from the duality between modular forms of weights $-r/2$ and $2+r/2$.

Number Theory · Mathematics 2018-11-20 Wladimir de Azevedo Pribitkin , Brandon Williams

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

Combinatorics · Mathematics 2018-12-05 Yuriy Choliy , Andrew V. Sills

We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…

Combinatorics · Mathematics 2019-03-14 Tiefeng Jiang , Ke Wang

In this paper we give unified formulas for the numbers of representations of positive integers as sums of four generalized $m$-gonal numbers, and as restricted sums of four squares under a linear condition, respectively. These formulas are…

Number Theory · Mathematics 2025-06-23 Jialin Li , Haowu Wang

The Hardy-Ramanujan formula for the number of integer partitions of $n$ is one of the most popular results in partition theory. While the unabridged final formula has been celebrated as reflecting the genius of its authors, it has become…

History and Overview · Mathematics 2021-07-06 Stephen DeSalvo

In 1937, Rademacher refined the circle method of Hardy and Ramanujan to derive an exact convergent series for the partition function $p(n)$. In 1942, Hua derived an exact formula for the distinct part partition function, and in 1971, Hagis…

Number Theory · Mathematics 2025-11-11 Archit Agarwal , Meghali Garg , Bibekananda Maji

Recently, $4$-regular partitions into distinct parts are connected with a family of overpartitions. In this paper, we provide a uniform extension of two relations due to Andrews for the two types of partitions. Such an extension is made…

Combinatorics · Mathematics 2023-01-27 George E. Andrews , Shane Chern

In this paper, we calculate an exact formula for the number of partitions of a natural number $n$, where the largest part is even and no odd parts appears more than two times. The generating functions of the number of these partitions is a…

Number Theory · Mathematics 2026-04-21 Kilian Rausch

A classical result from analytic number theory by Rademacher gives an exact formula for the Fourier coefficients of modular forms of non-positive weight. We apply similar techniques to study the spectrum of two-dimensional unitary conformal…

High Energy Physics - Theory · Physics 2020-12-30 Luis F. Alday , Jin-Beom Bae

We shall make use of the method of partial fractions to generalize some of Ramanujan's infinite series identities, including Ramanujan's famous formula for $\zeta(2n+1)$, and we shall also give a generalization of the transformation formula…

General Mathematics · Mathematics 2025-01-17 Aung Phone Maw
‹ Prev 1 2 3 10 Next ›