RANK AND CONGRUENCES FOR OVERPARTITION PAIRS
By Kathrin Bringmann, Jeremy Lovejoy. 2008
59 citations recorded by the source corpus.
Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics
View Paper: https://www.semanticscholar.org/paper/c47cf6572cd0d70ddc3f94423e554c2aeebf1ce3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
- Frank G. Garvan
- Robert Osburn
- Kathrin Bringmann
- Jeremy Lovejoy
- Chris Jennings-Shaffer
- Karl Mahlburg
- George E. Andrews
- Ken Ichi Ono
In Discrete Mathematics and Combinatorics
- Frank G. Garvan
- Kathrin Bringmann
- Robert Osburn
- Chris Jennings-Shaffer
- Jeremy Lovejoy
- Karl Mahlburg
- Robert C. Rhoades
- George E. Andrews
Citations in the corpus
- RANK DIFFERENCES FOR OVERPARTITIONS (2007, background): “The rank of a partition studied by Atkin and Swinnerton-Dyer is now understood to be a special case of a more general rank which is dened on overpartition pairs [ 6 ].”
- DYSON'S RANK, OVERPARTITIONS, AND WEAK MAASS FORMS (2007, background): “It is worth mentioning that for the case of the classical Dyson’s rank generating functions in [9], the weak Maass forms have weight 1/2 for every root of unity 6= 1. 3) The authors [ 7 ] show that in the context of overpartition pairs, the analogous generating functions associated to the appropriat”
- The spt-crank for overpartitions (2013, methodology): “The generating functions for the spt functions are given as follows; these are special cases of a general SPT function due to Bringmann, Lovejoy, and Osburn [15, Section 7], SPT( d, e ; q ) = ( − dq ; q ) ∞ ( − eq ; q ) ∞ ( deq ; q ) ∞ ( q ; q ) ∞ ∞ n =1 q n ( q ; q ) n ( deq ; q ) n (1 − q n ) 2 ( ”