相关论文: Overpartition pairs and two classes of basic hyper…

In a very recent work, G. E. Andrews defined the combinatorial objects which he called {\it singular overpartitions} with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers--Ramanujan type…

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…

We introduce a symmetry class for higher dimensional partitions - fully complementary higher dimensional partitions (FCPs) - and prove a formula for their generating function. By studying symmetry classes of FCPs in dimension 2, we define…

We derive generalized generating functions for basic hypergeometric orthogonal polynomials by applying connection relations with one free parameter to them. In particular, we generalize generating functions for the Askey-Wilson, continuous…

In a seminal 2007 paper, Andrews introduced a class of combinatorial objects that generalize partitions called $k$-marked Durfee symbols. Multivariate rank generating functions for these objects have been shown by many to have interesting…

We generalize the generating series of the Dyson ranks and $M_2$-ranks of overpartitions to obtain $k$-fold variants, and give a combinatorial interpretation of each. The $k$-fold generating series correspond to the full ranks of two…

The primary focus of this paper is overpartitions, a type of partition that plays a significant role in $q$-series theory. In 2006, Treneer discovered an explicit infinite family of congruences of overpartitions modulo $5$. In our research,…

Recently, Andrews gave a detailed study of partitions with even parts below odd parts in which only the largest even part appears an odd number of times. In this paper, we provide a combinatorial proof of the generating function identity of…

In this paper we study restricted overpartitions and concave compositions. In several cases the resulting generating functions involve simultaneously modular forms, mock theta functions, mock Maass theta functions, and false theta…

We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…

The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…

We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…

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 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…

For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…

We show how Andrews' generating functions for generalized Frobenius partitions can be understood within the theory of Eichler and Zagier as specific coefficients of certain Jacobi forms. This reformulation leads to a recursive process which…

We introduce an approach to the categorification of rings, via the notion of distributive categories with negative objects, and use it to lay down categorical foundations for the study of super, quantum and non-commutative combinatorics.…

We study a family of inhomogeneous Ising chain models along with an equivalent family of nearest neighbour particle systems. By the correspondence between the two families we prove identities of combinatorial significance relating to…

In this paper, cylindric partitions into profiles $c=(1,1)$ and $c=(2,0)$ are considered. The generating functions into unrestricted cylindric partitions and cylindric partitions into distinct parts with these profiles are constructed. The…

Partitions without sequences of consecutive integers as parts have been studied recently by many authors, including Andrews, Holroyd, Liggett, and Romik, among others. Their results include a description of combinatorial properties,…