Related papers: The Algorithm Z and Ramanujan's $_1\psi_1$ Summati…
A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…
In the sixth chapter of his notebooks Ramanujan introduced a method of summing divergent series which assigns to the series the value of the associated Euler-MacLaurin constant that arises by applying the Euler-MacLaurin summation formula…
Recently, Andrews and Paule studied Schmidt type partitions using MacMahon's Partition Analysis and obtained various interesting results. In this paper, we focus on the combinatorics of Schmidt type partition theorems and characterize them…
It is mathematical folklore that 1 + 2 + 3 + 4 + ... = --1/12. This result is usually achieved using elaborate analytical methods, such as zeta function regularization or Ramanujan summation. However, in its notebooks, Ramanujan has also…
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…
The closed-form expression for the quantum partition function of the improved Tietz oscillator is obtained using the Voronoi summation formula.
We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…
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…
We prove that there is a correspondence between Ramanujan-type formulas for 1/\pi, and formulas for Dirichlet L-values. The same method also allows us to resolve certain values of the Epstein zeta function in terms of rapidly converging…
Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…
We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…
Inspired by the recent pioneering work, dubbed "The Ramanujan Machine" by Raayoni et al. (arXiv:1907.00205), we (automatically) [rigorously] prove some of their conjectures regarding the exact values of some specific infinite continued…
Using some properties of the gamma function and the well-known Gauss summation formula for the classical hypergeometric series, we prove a four-parameter series expansion formula, which can produce infinitely many Ramanujan type series for…
We prove a Tauberian theorem for the Voronoi summation method of divergent series with an estimate of the remainder term. The results on the Voronoi summability are then applied to analyze the mean values of multiplicative functions on…
The Zippel algorithm performs a rational reconstruction of multivariate polynomials and aims specifically at the sparse case. It is applied in different fields of science, lately becoming an important step in Feynman integral reduction in…
A recent paper examined the global structure of integer partitions sequences and, via combinatorial analysis using modular arithmetic, derived a closed form expression for a map from (N, M) to the set of all partitions of a positive integer…
We establish necessary and sufficient conditions for a polynomial to be divisible by a cyclotomic polynomials and derive new formulas involving Ramanujan sums as an application of our results. Additionally, we provide new insights into the…
We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
The multiple zeta values are generalizations of the values of the Riemann zeta function at positive integers. They are known to satisfy a number of relations, among which are the cyclic sum formula. The cyclic sum formula can be stratified…