Recently, George Beck posed many interesting partition problems considering the number of ones in partitions. In this paper, we first consider the crank generating function weighted by the number of ones and obtain analytic formulas for this weighted crank function under conditions of the crank being less than or equal to some specific integer. We connect these cumulative and point crank functions to the generating functions of partitions with certain sizes of Durfee rectangles. We then consider a generalization of the crank for $k$-colored partitions, which was first introduced by Fu and Tang, and investigate the corresponding generating function for this crank weighted by the number of parts in the first subpartition of a $k$-colored p...
AbstractAn M-partition of a positive integer m is a partition with as few parts as possible such tha...
AbstractIn his memoir in 1984, George E. Andrews introduces many general classes of Frobenius partit...
Using an extension of Wright’s version of the circle method, we obtain asymptotic formulae for parti...
AbstractThe ‘crank’ is a partition statistic which originally arose to give combinatorial interpreta...
AbstractThe number cn of weighted partitions of an integer n, with parameters (weights) bk, k⩾1, is ...
Andrews, Garvan and Liang introduced the spt-crank for vector partitions. We conjecture that for any...
12 pagesRecent works of Andrews--Newman and Hopkins--Sellers unveil an interesting relation between ...
12 pagesRecent works of Andrews--Newman and Hopkins--Sellers unveil an interesting relation between ...
Several authors have recently considered the smallest positive part missing from an integer partitio...
In this paper, motivated by the work of Mahlburg, we find congruences for a large class of modular f...
AbstractIn this paper we shall give the generating functions for the enumeration of non-crossing par...
Recent works of Andrews--Newman and Hopkins--Sellers unveil an interesting relation between two part...
We consider colored partitions of a positive integer n, where the number of times a particular color...
Abstract. In a series of papers, H.-C. Chan has studied congruence properties of a certain kind of p...
Dyson's rank function and the Andrews--Garvan crank function famously givecombinatorial witnesses fo...
AbstractAn M-partition of a positive integer m is a partition with as few parts as possible such tha...
AbstractIn his memoir in 1984, George E. Andrews introduces many general classes of Frobenius partit...
Using an extension of Wright’s version of the circle method, we obtain asymptotic formulae for parti...
AbstractThe ‘crank’ is a partition statistic which originally arose to give combinatorial interpreta...
AbstractThe number cn of weighted partitions of an integer n, with parameters (weights) bk, k⩾1, is ...
Andrews, Garvan and Liang introduced the spt-crank for vector partitions. We conjecture that for any...
12 pagesRecent works of Andrews--Newman and Hopkins--Sellers unveil an interesting relation between ...
12 pagesRecent works of Andrews--Newman and Hopkins--Sellers unveil an interesting relation between ...
Several authors have recently considered the smallest positive part missing from an integer partitio...
In this paper, motivated by the work of Mahlburg, we find congruences for a large class of modular f...
AbstractIn this paper we shall give the generating functions for the enumeration of non-crossing par...
Recent works of Andrews--Newman and Hopkins--Sellers unveil an interesting relation between two part...
We consider colored partitions of a positive integer n, where the number of times a particular color...
Abstract. In a series of papers, H.-C. Chan has studied congruence properties of a certain kind of p...
Dyson's rank function and the Andrews--Garvan crank function famously givecombinatorial witnesses fo...
AbstractAn M-partition of a positive integer m is a partition with as few parts as possible such tha...
AbstractIn his memoir in 1984, George E. Andrews introduces many general classes of Frobenius partit...
Using an extension of Wright’s version of the circle method, we obtain asymptotic formulae for parti...