Related papers: The Algorithm Z and Ramanujan's $_1\psi_1$ Summati…
In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…
In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…
Buryak, Feigin and Nakajima computed a generating function for a family of partition statistics by using the geometry of the $Z/cZ$ fixed point sets in the Hilbert scheme of points on $C^2$. Loehr and Warrington had already shown how a…
We present a new FPTAS for the Subset Sum Ratio problem, which, given a set of integers, asks for two disjoint subsets such that the ratio of their sums is as close to $1$ as possible. Our scheme makes use of exact and approximate…
In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.
In 1981, Andrews gave a four-variable generalization of Ramanujan's ${_1\psi_1}$ summation formula. We establish a six-variable generalization of Andrews' identity according to the transformation formula for two ${_8\phi_7}$ series and…
In this work we present the computer algebra package HarmonicSums and its theoretical background for the manipulation of harmonic sums and some related quantities as for example Euler-Zagier sums and harmonic polylogarithms. Harmonic sums…
A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…
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 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,…
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…
We focus on writing closed forms of generating functions for the number of partitions with gap conditions as double sums starting from a combinatorial construction. Some examples of the sets of partitions with gap conditions to be discussed…
We propose a simple estimator that allows to calculate the absolute value of a system's partition function from a finite sampling of its canonical ensemble. The estimator utilizes a volume correction term to compensate the effect that the…
We express the Riemann zeta function $\zeta\left(s\right)$ of argument $s=\sigma+i\tau$ with imaginary part $\tau$ in terms of three absolutely convergent series. The resulting simple algorithm allows to compute, to arbitrary precision,…
The polynomial Ramanujan sum was first introduced by Carlitz [7], and a generalized version by Cohen [10]. In this paper, we study the arithmetical and analytic properties of these sums, derive various fundamental identities, such as H…
In 2003, Maroti showed that one could use the machinery of l-cores and l-quotients of partitions to establish lower bounds for p(n), the number of partitions of n. In this paper we explore these ideas in the case l=2, using them to give a…
An operatorial method, already employed to formulate a generalization of the Ramanujan master theorem, is applied to the evaluation of integrals of various type. This technique provide a very flexible and powerful tool yielding new results…
Extending Sellers' result, Das et al. recently proved some congruence results for generalized overcubic partitions using theta functions and posed some related conjectures. In this paper, we provide a combinatorial proof of a result in…