Related papers: Towards an automation of the circle method
We deduce from the strong form of the Hardy--Ramanujan asymptotics for the partition function $p(n)$ an asymptotics for $p_{-S}(n)$, the number of partitions of $n$ that do not use parts from a finite set $S$ of positive integers. We apply…
Within recent years, considerable progress has been made regarding high-performance solvers for Partial Differential Equations (PDEs), yielding potential gains in efficiency compared to industry standard tools. However, the latter largely…
Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
In this note, we obtain a formula which leads to a practical and efficient method to calculate the number of partitions of n into parts not divisible by m for given natural numbers n and m.
We give an upper bound for the error term in the Hardy-Ramanujan-Rademacher formula for the partition function. The main input is a new hybrid subconvexity bound for the central value $L(\tfrac 12,f\times (\tfrac{q}{\cdot}))$ in the $q$ and…
Let $\mathfrak{p}_{\mathbb{P}_r}(n)$ denote the number of partitions of $n$ into $r$-full primes. We use the Hardy-Littlewood circle method to find the asymptotic of $\mathfrak{p}_{\mathbb{P}_r}(n)$ as $n \to \infty$. This extends previous…
Infinite series are evaluated through the manipulation of a series for $\cos(2t \sin^{-1}x)$ resulting from Clausen's Product. Hypergeometric series equal to an expression involving $\frac{1} {\pi}$ are determined. Techniques to evaluate…
We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…
We derive continued fractions for partition generating functions, utilizing both Euler's techniques and Ramanujan's techniques. Although our results are for integer partitions there is scope to extend this work to vector partitions,…
High-order derivatives of analytic functions are expressible as Cauchy integrals over circular contours, which can very effectively be approximated, e.g., by trapezoidal sums. Whereas analytically each radius r up to the radius of…
Using elementary methods, we prove new formulas for $\operatorname{pp}(n)$, the number of plane partitions of $n$, $\operatorname{pp}_r(n)$, the number of plane partitions of $n$ with at most $r$ rows, $\operatorname{pp}^s(n)$, the number…
We establish a new multiplicity lemma for solutions of a differential system extending Ramanujan's classical differential relations. This result can be useful in the study of arithmetic properties of values of Riemann zeta function at odd…
A simple integration by parts and telescopic cancellation leads to a rigorous derivation of the first 2 terms for the error in Ramanujan's asymptotic series for the nth partial sum of the harmonic series. Then Kummer's transformation gives…
The Hardy-Ramanujan partition function asymptotics is a famous result in the asymptotics of combinatorial sequences. It was originally derived using complex analysis and number-theoretic ideas by Hardy and Ramanujan. It was later re-derived…
In the present article a new method of deriving integral representations of combinations and partitions in terms of harmonic products has been established. This method may be relevant to statistical mechanics and to number theory.
In this paper we review the recently proposed path-integral counterpart of the Koopman-von Neumann operatorial approach to classical Hamiltonian mechanics. We identify in particular the geometrical variables entering this formulation and…
We give new nested radical equations of similar kind to Ramanujan's questions to the Indian Mathematical Society 100 years ago. While many have since considered these from the perspectives of the Notebooks of Ramanujan and from the theory…
A partition statistic ` crank' gives combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of…
In this note, we provide a unifying framework to investigate the computational complexity of classical spin models and give the full classification on spin models in terms of system dimensions, randomness, external magnetic fields and types…