Related papers: Number Identities and Integer Partitions
In this paper, we prove that there is a natural correspondence between product identities for theta functions and integer matrix exact covering systems. We show that since $\mathbb{Z}^n$ can be taken as the disjoint union of a lattice…
We use the method of tiling to give elementary combinatorial proofs of some celebrated $q$-series identities, such as Jacobi triple product identity, Rogers-Ramanujan identities, and some identities of Rogers. We give a tiling proof of the…
We introduce and study the arithmetic function E_m(n), defined as the sum of the remainders of n when divided by the first m positive integers. Although the definition is elementary, the function encodes rich arithmetic structure. In this…
Recently there has been quite a bit of study carried out related to arithmetic properties of overpartitions into non-multiples of two co-prime integers. The paper [19] by Nadji et al. looked into congruences modulo $3$ and powers of $2$ for…
We present an algorithmic approach to the verification of identities on multiple theta functions in the form of products of theta functions $[(-1)^{\delta}a_1^{\alpha_1}a_2^{\alpha_2}\cdots a_r^{\alpha_r}q^{s}; q^{t}]_\infty$, where…
In this note, we present a curious $q$-series identity with applications to certain partitions with bounded part differences.
Slater's list of Rogers-Ramanujan type identities consists of 130 series-product identities whose analytic proofs rely primarily on Bailey pair techniques. Although these identities play an important role in the theory of $q$-series and…
Recently, Andrews introduced separable integer partition classes and analyzed some well-known theorems. In this paper, we investigate partitions with parts separated by parity introduced by Andrews with the aid of separable integer…
When searching for Calabi.Yau differential equations, often different formulas for the coefficients give the same differential equation. The coefficients are usually sums (simple, double or triple) of products of binomial coefficients. This…
By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…
Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…
The work of Andrews and Merca on the truncated Euler's pentagonal number theorem led to a resurgence in research on truncated theta series identities. In particular, Yee proved a truncated version of the Jacobi Triple Product (JTP)…
Sums of the form $\sum_{N_m=q}^{n}{\cdots \sum_{N_1=q}^{N_2}{a_{(m);N_m}\cdots a_{(1);N_1}}}$ where the $a_{(k);N_k}$'s are same or distinct sequences appear quite often in mathematics. We will refer to them as recurrent sums. In this…
In this note, we provide a conceptual explanation of a well-known polynomial identity used in algebraic number theory.
We prove analytic and combinatorial identities reminiscent of Schur's classical partition theorem. Specifically, we show that certain families of overpartitions whose parts satisfy gap conditions are equinumerous with partitions whose parts…
In 2015 Cristian-Silviu Radu designed an algorithm to detect identities of a class studied by Ramanujan and Kolberg. This class includes the famous identities by Ramanujan which provide a witness to the divisibility properties of $p(5n+4),$…
We pursue the question how integers can be ordered or partitioned according to their divisibility properties. Based on pseudometrics on $\mathbb{Z}$, we investigate induced preorders, associated equivalence relations, and quotient sets. The…
We present a simple iteration for the Lebesgue identity on partitions, which leads to a refinement involving the alternating sums of partitions.
We determine an infinite family of linear identities for the number $A_4(n)$ of partition pairs of $n$ with $4$-cores by employing elementary $q$-series techniques and certain $3$-dissection formulas. We then discover an infinite family of…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…