Asymptotics of crank generating functions and Ramanujan congruences (Q746393): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1311.4344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruence properties for the partition function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dyson’s crank of a partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Properties of Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for differences of Dyson's rank for all odd moduli / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics for rank partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taylor coefficients of mock-Jacobi forms and moments of partition statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of Jacobi forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Combinatorial Interpretations of Ramanujan's Partition Congruences Mod 5,7 and 11 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of quasimodular forms and Jacobi forms: The crank statistic for partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3590677 / rank
 
Normal rank

Revision as of 21:35, 10 July 2024

scientific article
Language Label Description Also known as
English
Asymptotics of crank generating functions and Ramanujan congruences
scientific article

    Statements

    Asymptotics of crank generating functions and Ramanujan congruences (English)
    0 references
    16 October 2015
    0 references
    Using the circle method, the author derives an asymptotic formula for the Fourier coefficients of \(C(e^{\frac{2\pi i a}{c}};q)\), where \(0 < a < c\) are coprime integers, \(c\) is odd, and \[ C(z;q) := \prod_{n \geq 1} \frac{(1-q^n)}{(1-zq^n)(1-q^n/z)}. \] For \(n \geq 2\), the coefficient of \(z^mq^n\) in the expansion of \(C(z;q)\) is the number of partitions of \(n\) with \textit{crank} equal to \(m\). \textit{F. G. Garvan} [Trans. Am. Math. Soc. 305, No. 1, 47--77 (1988; Zbl 0641.10009)] showed that if \(M(a,c,n)\) denotes the number of partitions of \(n\) with crank congruent to \(a\) modulo \(c\), then for any integer \(a\) and for all non-negative integers \(n\) we have \[ M(a,5,5n+4) = \frac{1}{5}p(5n+4), \] \[ M(a,7,7n+5) = \frac{1}{7}p(7n+5), \] and \[ M(a,11,11n+6) = \frac{1}{11}p(11n+6), \] where \(p(n)\) denotes the number of partitions of \(n\). Thus the crank provides a combinatorial explanation of Ramanujan's congruences \[ p(5n+4) \equiv 0 \pmod{5}, \] \[ p(7n+5) \equiv 0 \pmod{7}, \] and \[ p(11n+6) \equiv 0 \pmod{11}. \] An interesting consequence of the author's asymptotic formula is that for \(0 \leq a < b \leq \frac{c-1}{2}\) with \(c > 11\) an odd integer, we have \[ M(a,c,n) > M(b,c,n) \] for all \(n > N_{a,b,c}\), where \(N_{a,b,c}\) is an explicit constant. This means that the crank cannot explain any congruences for \(p(n)\) other than Ramanujan's.
    0 references
    partitions
    0 references
    crank
    0 references
    asymptotics
    0 references
    circle method
    0 references
    congruences
    0 references
    Ramanujan
    0 references
    modular forms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references