Related papers: Andrews Style Partition Identities
We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…
A numerical framework based on network partition and operator splitting is developed to solve nonlinear differential equations of large-scale dynamic processes encountered in physics, chemistry and biology. Under the assumption that those…
Let $\mathscr{S}$ denote the set of integer partitions into parts that differ by at least $3$, with the added constraint that no two consecutive multiples of $3$ occur as parts. We derive trivariate generating functions of Andrews--Gordon…
Andrews and El Bachraoui recently studied integer partitions where the smallest part is repeated a specified number of times and any other parts are distinct. Their results included two ``surprising identities'' for which they requested…
We study families of partitions with gap conditions that were introduced by Schur and Andrews, and describe their fundamental connections to combinatorial q-series and automorphic forms. In particular, we show that the generating functions…
In this paper, we consider a generalization of the Stirling number sequence of both kinds by using a specialization of a new family of symmetric functions. We give combinatorial interpretations for this symmetric functions by means of…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of the dual partitions are investigated and a convenient test is given for the case that the bidual partition…
The original Beck conjecture, now a theorem due to Andrews, states that the difference in the number of parts in all partitions into odd parts and the number of parts in all strict partitions is equal to the number of partitions whose set…
Andrews, Lewis and Lovejoy introduced the partition function PD(n) as the number of partitions of $n$ with designated summands, where we assume that among parts with equal size, exactly one is designated. They proved that PD(3n+2) is…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
The restricted partitions in which the largest part is less than or equal to $N$ and the number of parts is less than or equal to $k$ were investigated by Andrews in \cite{Andrews76}. These partitions were extended recently by the author to…
This paper proposes a Newton-type method to solve numerically the eigenproblem of several diagonalizable matrices, which pairwise commute. A classical result states that these matrices are simultaneously diagonalizable. From a suitable…
We give a series of recursive identities for the number of partitions with exactly $k$ parts and with constraints on both the minimal difference among the parts and the minimal part. Using these results we demonstrate that the number of…
We find two involutions on partitions that lead to partition identities for Ramanujan's third order mock theta functions $\phi(-q)$ and $\psi(-q)$. We also give an involution for Fine's partition identity on the mock theta function f(q).…
The main aim of this paper is to provide a novel approach to deriving identities for the Bernstein polynomials using functional equations. We derive various functional equations and differential equations using generating functions.…
Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…
In this article, we refine a result of Andrews and Newman, that is, the sum of minimal excludants over all the partitions of a number $n$ equals the number of partitions of $n$ into distinct parts with two colors. As a consequence, we find…
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…
The celebrated Rogers-Ramanujan identities equate the number of integer partitions of $n$ ($n\in\mathbb N_0$) with parts congruent to $\pm 1 \pmod{5}$ (respectively $\pm 2 \pmod{5}$) and the number of partitions of $n$ with super-distinct…