中文
相关论文

相关论文: Exotic Bailey-Slater SPT-Functions III: Bailey Pai…

200 篇论文

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…

数论 · 数学 2014-11-14 Chris Jennings-Shaffer

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…

数论 · 数学 2016-07-08 Frank Garvan , Chris Jennings-Shaffer

We construct new smallest parts partition functions and smallest parts crank functions by considering variations of Bailey's Lemma and conjugate Bailey pairs. The functions we introduce satisfy simple linear congruences modulo $3$ and $5$.…

数论 · 数学 2017-04-06 Chris Jennings-Shaffer

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

数论 · 数学 2014-12-12 Frank Garvan , Chris Jennings-Shaffer

Andrews' spt-function can be written as the difference between the second symmetrized crank and rank moment functions. Using the machinery of Bailey pairs a combinatorial interpretation is given for the difference between higher order…

数论 · 数学 2010-11-02 F. G. Garvan

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…

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…

数论 · 数学 2014-12-12 Chris Jennings-Shaffer

In a recent paper, Andrews, Dixit, and Yee introduced a new spt-type function $\operatorname{spt}_\omega(n)$, which is closely related to Ramanujan's third order mock theta function $\omega(q)$. Garvan and Jennings-Shaffer introduce a crank…

数论 · 数学 2016-10-20 Min-Joo Jang , Byungchan Kim

Dyson famously provided combinatorial explanations for Ramanujan's partition congruences modulo $5$ and $7$ via his rank function, and postulated that an invariant explaining all of Ramanujan's congruences modulo $5$, $7$, and $11$ should…

数论 · 数学 2021-05-28 Larry Rolen , Zack Tripp , Ian Wagner

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…

数论 · 数学 2018-08-13 Alexander E Patkowski

In this paper we obtain asymptotic formulas for the Fourier coefficients of an infinite family of crank generating functions. Moreover we use this result to show that the crank obeys certain inequalities. This implies that the crank can not…

数论 · 数学 2013-11-19 Jose Miguel Zapata Rolon

Let spt(n) denote the total number of appearances of smallest parts in the partitions of n. Recently, Andrews showed how spt(n) is related to the second rank moment, and proved some surprising Ramanujan-type congruences mod 5, 7 and 13. We…

数论 · 数学 2008-06-11 F. G. Garvan

In 1919, Ramanujan discovered his famous congruences for the partition function. Not too long after, Freeman Dyson conjectured a combinatorial statistic existed that explained the three congruences, which he dubbed the \textit{crank}. A…

组合数学 · 数学 2026-03-23 Samuel Wilson

The spt-function $spt(n)$ was introduced by Andrews as the weighted counting of partitions of $n$ with respect to the number of occurrences of the smallest part. Andrews, Garvan and Liang defined the spt-crank of an $S$-partition which…

组合数学 · 数学 2013-08-15 William Y. C. Chen , Kathy Q. Ji , Wenston J. T. Zang

The study of Ramanujan-type congruences for functions specific to additive number theory has a long and rich history. Motivated by recent connections between divisor sums and overpartitions via congruences in arithmetic progressions, we…

数论 · 数学 2022-05-12 William Craig , Mircea Merca

Dyson's rank function and the Andrews--Garvan crank function famously give combinatorial witnesses for Ramanujan's partition function congruences modulo 5, 7, and 11. While these functions can be used to show that the corresponding sets of…

数论 · 数学 2022-03-23 Kathrin Bringmann , Kevin Gomez , Larry Rolen , Zack Tripp

In this note, we offer some relations and congruences for an interesting $spt$-type function.

数论 · 数学 2015-07-16 Alexander E Patkowski

Let $p$ be an odd prime. The bar partitions with sign and $p$-bar-core partitions with sign respectively label the spin characters and $p$-defect zero spin characters of the double cover of the symmetric group, and by restriction, those of…

表示论 · 数学 2024-05-31 Rishi Nath , James A. Sellers

Let \pi be a partition. In [2] we defined BG-rank(\pi) as an alternating sum of parities of parts. This statistic was employed to generalize and refine the famous Ramanujan modulo 5 partition congruence. Let p_j(n)(a_{t,j}(n)) denote a…

组合数学 · 数学 2007-05-23 Alexander Berkovich , Frank G. Garvan

For rational $\alpha$, the fractional partition functions $p_\alpha(n)$ are given by the coefficients of the generating function $(q;q)^\alpha_\infty$. When $\alpha=-1$, one obtains the usual partition function. Congruences of the form…

数论 · 数学 2019-07-17 Erin Bevilacqua , Kapil Chandran , Yunseo Choi
‹ 上一页 1 2 3 10 下一页 ›