相关论文: Certain positive $q$-series and inequalities for t…

We investigate some weighted integer partitions whose generating functions are double-series. We will establish closed formulas for these $q$-double series and deduce that their coefficients are non-negative. This leads to inequalities…

For positive integers $n, L$ and $s$, consider the following two sets that both contain partitions of $n$ with the difference between the largest and smallest parts bounded by $L$: the first set contains partitions with smallest part $s$,…

We consider $(k,j)$-colored partitions, partitions in which $k$ colors exist but at most $j$ colors may be chosen per size of part. In particular these generalize overpartitions. Advancing previous work, we find new congruences, including…

The $q$-binomial coefficients $\qbinom{n}{m}=\prod_{i=1}^m(1-q^{n-m+i})/(1-q^i)$, for integers $0\le m\le n$, are known to be polynomials with non-negative integer coefficients. This readily follows from the $q$-binomial theorem, or the…

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

Let $a_{r,s}(n)$ denote the number of mutlicolored partitions of $n$, wherein both even parts and odd parts may appear in one of $r$-colors and $s$-colors, respectively, for fixed $r,s\ge 1$. The paper aims to study arithmetic properties…

Let $b^{k}_{\ell,m}(n)$ denotes the number of $k-$colored partitions of $n$ into parts that are not multiples of $\ell$ or $m$. We establish several congruence relations for $b_{\ell,m}(n)$. For instance, for any nonnegative integer $n$…

For a fixed positive integer $m$ and any partition $m = m_1 + m_2 + \cdots + m_e$ , there exists a sequence $\{n_{i}\}_{i=1}^{k}$ of positive integers such that $$m=\frac{1}{n_{1}}+\frac{1}{n_{2}}+\cdots+\frac{1}{n_{k}},$$ with the property…

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the…

Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that…

We consider sequences counting integer partitions in two colors (red and blue) in which the even parts occur only in blue color. We focus on subsequences defined by constraints on the parity and color of the summands. We establish formulas…

We construct a $k$-fold $q$-series as a generating function of $k$-regular partitions for each positive integer $k$. The $k=1$ case is one of Euler's $q$-series identities pertaining to the partitions into distinct parts. The construction…

For a fixed positive integer $k$, let $C(k,n)$ denote the number of two-color partitions of $n$ with odd smallest part and restrictions on even parts, and let $C_k(q)$ be its generating function. We show that $C(1,n)\equiv d(2n-1)\pmod{4}$…

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

Using $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, which was the subject of an earlier paper, $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, can be…

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…

For any positive integers $s$ and $t$, let $Q_{t}^{s}(n)$ denotes the number of partitions of a positive integer $n$ into distinct parts such that no part is congruent to $s$ or $t-s$ modulo $t$. We prove some Ramanujan-type congruences for…

The $q$-analogue of an integer $m$ is given by $[m]_q=(1-q^m)/(1-q)$. Let $a$ be an integer, and let $n$ be a positive odd integer. Via discrete Fourier transforms, we establish the following two identities:…

This paper addresses the problem of finding $Q_{m,t}\left(n\right)$, the number of possible ways to partition any member $n$ of the cyclic group $\mathbb{Z}/m\mathbb{Z}$ into $t$ distinct parts. When $m$ is odd, it was previously known that…