English
Related papers

Related papers: The Algorithm Z and Ramanujan's $_1\psi_1$ Summati…

200 papers

We use a specialization of Ramanujan's ${}_1\psi_1$ summation to give a new proof of a recent formula of Hickerson and Mortenson which expands a special family of Hecke-type double sums in terms of Appell-Lerch sums and theta functions.

Number Theory · Mathematics 2014-07-29 Eric Mortenson

Several terminating generalizations of Ramanujan's formula for $\frac{1}{\pi}$ with complete WZ proofs are given.

Combinatorics · Mathematics 2009-03-04 Moa Apagodu

For a vector $\mathbf a=(a_1,\ldots,a_r)$ of positive integers we prove formulas for the restricted partition function $p_{\mathbf a}(n): = $ the number of integer solutions $(x_1,\dots,x_r)$ to $\sum_{j=1}^r a_jx_j=n$ with $x_1\geq 0,…

Combinatorics · Mathematics 2018-12-11 Mircea Cimpoeas , Florin Nicolae

Explicit formulas involving a generalized Ramanujan sum are derived. An analogue of the prime number theorem is obtained and equivalences of the Riemann hypothesis are shown. Finally, explicit formulas of Bartz are generalized.

Number Theory · Mathematics 2015-04-02 Patrick Kühn , Nicolas Robles

We show with some examples how to prove some Ramanujan-type series for $1/\pi$ in an elementary way by using terminating identities.

Number Theory · Mathematics 2018-04-17 Jesús Guillera

We examine "partition zeta functions" analogous to the Riemann zeta function but summed over subsets of integer partitions. We prove an explicit formula for a family of partition zeta functions already shown to have nice properties -- those…

Number Theory · Mathematics 2021-05-12 Robert Schneider , Andrew V. Sills

In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…

Discrete Mathematics · Computer Science 2010-12-30 Manosij Ghosh Dastidar , Sourav Sen Gupta

We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.

Combinatorics · Mathematics 2014-11-26 Daniel K. Du , Qing-Hu Hou , Charles B. Mei

We present an algorithm to calculate the result of combinatorial wall-crossing at every step starting with the column partition of prime size. This algorithm is confirmed by computer calculations. The output of the algorithm is consistent…

Combinatorics · Mathematics 2023-03-07 Galyna Dobrovolska

The general problem of the factorization of a basic hypergeometric series is presented and discussed. The case of the general $_2\psi_2$ series is examined in detail. Connections are found with the theory of basic hypergeometric series on…

Combinatorics · Mathematics 2025-07-08 Jonathan G. Bradley-Thrush

In a previous work (arXiv:2505.05574), a summation formula for harmonic Maass forms of polynomial growth was established. In this note, we use the theory of $L$-series of harmonic Maass forms to state and prove a summation formula for such…

Number Theory · Mathematics 2025-09-29 Nikolaos Diamantis , Joshua Pimm

We give combinatorial proofs of several recent results due to Merca on the sum of different parts congruent to $r$ modulo $m$ in all partitions of $n$. The proofs make use of some well known involutions from the literature and some new…

Combinatorics · Mathematics 2023-03-28 Cristina Ballantine

We set up a combinatorial framework for inclusion-exclusion on the partitions into distinct parts to obtain an alternative generating function of partitions into distinct and non-consecutive parts. In connection with Rogers-Ramanujan…

Combinatorics · Mathematics 2020-04-14 Kağan Kurşungöz

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

We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial…

Classical Analysis and ODEs · Mathematics 2011-05-03 William Y. C. Chen , Qing-Hu Hou , Hai-Tao Jin

We provide new formulas for the coefficients in the partial fraction decomposition of the restricted partition generating function. These techniques allow us to partially resolve a recent conjecture of Sills and Zeilberger. We also describe…

Number Theory · Mathematics 2014-01-14 Cormac O'Sullivan

We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…

Number Theory · Mathematics 2016-05-19 Robert Schneider

Following suggestions of T. H. Koornwinder, we give a new proof of Kummer's theorem involving Zeilberger's algorithm, the WZ method and asymptotic estimates. In the first section, we recall a classical proof given by L. J. Slater. The…

Classical Analysis and ODEs · Mathematics 2007-05-23 Bruno Gauthier

Ramanujan sums have attracted significant attention in both mathematical and engineering disciplines due to their diverse applications. In this paper, we introduce an algebraic generalization of Ramanujan sums, derived through polynomial…

Number Theory · Mathematics 2025-07-09 N. Uday Kiran

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