相关论文: An overpartition analogue of Bressoud conjecture f…

In 1980, Bressoud conjectured a combinatorial identity $A_j=B_j$ for $j=0$ or $1$, where the function $A_j$ counts the number of partitions with certain congruence conditions and the function $B_j$ counts the number of partitions with…

The main objective of this paper is to present an answer to Bressoud's conjecture for the case $j=0$, resulting in a complete solution to the conjecture. The case for $j=1$ has been recently resolved by Kim. Using the connection established…

Bressoud introduced the partition function $B(\alpha_1,\ldots,\alpha_\lambda;\eta,k,r;n)$, which counts the number of partitions with certain difference conditions. Bressoud posed a conjecture on the generating function for the partition…

In 1967, Andrews found a combinatorial generalization of the G\"ollnitz-Gordon theorem, which can be called the Andrews-G\"ollnitz-Gordon theorem. In 1980, Bressoud derived a multisum Rogers-Ramanujan-type identity, which can be considered…

For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

We study the generating function for overpartitions with bounded differences between largest and smallest parts, which is analogous to a result of Breuer and Kronholm on integer partitions. We also connect this problem with over…

We construct a family of partition identities which contain the following identities: Rogers-Ramanujan-Gordon identities, Bressoud's even moduli generalization of them, and their counterparts for overpartitions due to Lovejoy et al. and…

We give an overpartition analogue of Bressoud's combinatorial generalization of the G\"ollnitz-Gordon theorem for even moduli in general case. Let $\widetilde{O}_{k,i}(n)$ be the number of overpartitions of $n$ whose parts satisfy certain…

Let $\overline{\mathrm{spt}}k(n)$ denote the number of overpartitions of $n$ where the smallest non-overlined part, say $s(\pi)$, appears $k$ times and every overlined part is bigger than $s(\pi)$. Let $\overline{\mathrm{spt}}k_o(n)$ denote…

Let $\overline{p}_o(n)$ denote the number of overpartitions of $n$ into odd parts. The partition function $\overline{p}_o(n)$ has been the subject of many recent studies where many explicit Ramanujan-like congruences were discovered. In…

In 1984, Bressoud and Subbarao obtained an interesting weighted partition identity for a generalized divisor function, by means of combinatorial arguments. Recently, the last three named authors found an analytic proof of the aforementioned…

We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over…

In 2014, as part of a larger study of overpartitions with restrictions of the overlined parts based on residue classes, Munagi and Sellers defined $d_2(n)$ as the number of overpartitions of weight $n$ wherein only even parts can be…

Inspired by Andrews' and Bachraoui's work on partitions with repeated smallest part, we extend the concept to overpartitions. We study overpartitions with the restriction that the smallest non-overlined part appears exactly $k$ times and…

Let $B_{k,i}(n)$ be the number of partitions of $n$ with certain difference condition and let $A_{k,i}(n)$ be the number of partitions of $n$ with certain congruence condition. The Rogers-Ramanujan-Gordon theorem states that…

Recently, Andrews and EI Bachraoui discovered several companions for some famous $q$-series formulas, and derived some new identities involving partitions and overpartitions with distinct parts. In this paper, we shall refine their results…

Singular overpartitions, which are defined by George Andrews, are overpartitions whose Frobenius symbols have at most one overlined entry in each row. In his paper, Andrews obtained interesting combinatorial results on singular…

A partition of a positive integer $n$ is a non-increasing sequence of positive integers which sum to $n$. A recently studied aspect of partitions is the minimal excludant of a partition, which is defined to be the smallest positive integer…

Let $\overline{B}_{s,t}(n)$ denote the number of overpartitions of $n$ where no part is divisible by $s$ or $t$, with $s$ and $t$ being coprime. By establishing the exact generating functions of a family of arithmetic progressions in…