相关论文: Some Smallest Parts Functions from Variations of B…
We investigate spt-crank-type functions arising from Bailey pairs. We recall four spt-type functions corresponding to the Bailey pairs $A1$, $A3$, $A5$, and $A7$ of Slater and given four new spt-type functions corresponding to Bailey pairs…
We introduce several spt-type functions that arise from Bailey pairs. We prove simple Ramanujan type congruences for these functions which can be explained by a spt-crank-type function. The spt-crank-type functions are constructed by adding…
We continue to investigate spt-type functions that arise from Bailey pairs. In this third paper on the subject, we proceed to introduce additional spt-type functions. We prove simple Ramanujan type congruences for these functions which can…
We generalize a result of Garvan on inequalities and interpretations of the moments of the partition rank and crank functions. In particular for nearly 30 Bailey pairs, we introduce a rank-like function, establish inequalities with the…
This paper presents the methods to utilizing the $s$-fold extension of Bailey's lemma to obtain $spt$-type functions related to the symmetrized rank function $\eta_{2k}(n).$ We provide the $k=2$ example, but clearly illustrate how deep…
We consider the symmetrized moments of three ranks and cranks, similar to the work of Garvan for the rank and crank of a partition. By using Bailey pairs and elementary rearrangements, we are able to find useful expressions for these…
By considering the $M_2$-rank of an overpartition as well as a residual crank, we give another combinatorial refinement of the congruences $\overline{\mbox{spt}}_2(3n)\equiv \overline{\mbox{spt}}_2(3n+1)\equiv 0\pmod{3}$. Here…
Bringmann, Lovejoy, and Osburn showed that the generating functions of the spt-overpartition functions spt(n), spt1(n), spt2(n), and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews,…
Recently, Andrews, Dixit and Yee introduced partition functions associated with Ramanujan/Watson third order mock theta functions $\omega(q)$ and $\nu(q)$. In this paper, we find several new exact generating functions for those partition…
We prove infinitely many congruences modulo 3, 5, and powers of 2 for the overpartition function $\bar{p}(n)$ and two smallest parts functions: $\bar{\operatorname{spt1}}(n)$ for overpartitions and $\operatorname{M2spt}(n)$ for partitions…
We offer some partition functions related to ternary quadratic forms, and note on their upper bounds and related properties. We offer these results as an application of a simple method related to conjugate Bailey pairs presented in a prior…
Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…
In 2017, Andrews, Dixit, Schultz and Yee introduced the function $\overline{\textrm{spt}}_\omega(n)$, which denotes the number of smallest parts in the overpartitions of $n$ in which the smallest part is always overlined and all odd parts…
Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…
In this paper a small survey is presented on eighteen new functions and four new sequences, such as: Inferior/Superior f-Part, Fractional f-Part, Complementary function with respect with another function, S-Multiplicative, Primitive…
Building on work of Hardy and Ramanujan, Rademacher proved a well-known formula for the values of the ordinary partition function $p(n)$. More recently, Bruinier and Ono obtained an algebraic formula for these values. Here we study the…
We introduce two new integer partition functions, both of which are the number of partition quadruples of $n$ with certain size restrictions. We prove both functions satisfy Ramanujan-type congruences modulo $3$, $5$, $7$, and $13$ by use…
In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…
We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions $\{0,1\}^k\to\mathbb{R}_{\geq 0}$) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice…
We obtain recurrences for smallest parts functions which resemble Euler's recurrence for the ordinary partition function. The proofs involve the holomorphic projection of non-holomorphic modular forms of weight 2.