Uniform asymptotic formulas for the Fourier coefficients of the inverse of theta functions (Q2115275)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7490461
Language Label Description Also known as
default for all languages
No label defined
    English
    Uniform asymptotic formulas for the Fourier coefficients of the inverse of theta functions
    scientific article; zbMATH DE number 7490461

      Statements

      Uniform asymptotic formulas for the Fourier coefficients of the inverse of theta functions (English)
      0 references
      0 references
      15 March 2022
      0 references
      The authors investigate the more precise uniform asymptotic behavior of \(j_{m,k}(n)\), \(a_{m,k}(n)\), and \(b_{m,k}(n)\), which is partly suggested by \textit{K. Bringmann} and \textit{J. Manschot} [Commun. Number Theory Phys. 7, No. 3, 497--513 (2013; Zbl 1312.14106), Section 1.2], and presented their main findings in the form of ten results (stated as Theorem 1.1--1.10) along with several supporting subsidiary results recorded as corollaries and propositions. The proofs of Theorems 1.7--1.8 are given in Section 3, Theorems 1.9--1.10 are given in Section 4, and Theorems 1.1--1.6 and numerical illustration for the cases of \(b_{m,1}(n)\) and \(N_{2}(m,n)-N_{2}(m+1,n)\) are given in Section 5.1. In Theorem 1.1, the authors discuss that uniform asymptotic formula for \(a_{m,k}(n)\) holds for more-ranging \(m\) and smaller error term than in the work of \textit{K. Bringmann} and \textit{J. Dousse} [Trans. Am. Math. Soc. 368, No. 5, 3141--3155 (2016; Zbl 1331.05029), Theorem 1.4]; Theorems 1.1 and 1.2 give the uniform asymptotics for the rank and crank statistics for integers partitions; in Theorem 1.3 asymptotic formula for \(N_{2}(m,n)\) improves the results of \textit{J. Dousse} and \textit{M. H. Mertens} [Acta Arith. 168, No. 1, 83--100 (2015; Zbl 1316.05009)]. The authors introduce a parameter \(\mu\) in the Theorem 1.7, so that they can conveniently compute the difference of \(S_{f}(a,b;x)\) with respect to \(b\), this was required to compute the asymptotics for, \(a_{m,k}(n)=j_{m,k}(n)-j_{m+1,k}(n)\), \(b_{m,k}(n)=a_{m,k}(n)-a_{m+1,k}(n)\), \(N_{k}(m,n)=I_{k}(|m|,n)-I_{k}(|m|+1,n)\) etc. Theorems 1.1--1.6 are proved with the help of the Theorems 1.9--1.10. The leading uniform asymptotics of \(a_{m,k}(n)\) and \(N_{2}(m,n)\) have already been proved in the existing literature, but the leading uniform asymptotics of \(b_{m,k}(n)\) and \(N_{k}(m,n)-N_{k}(m+1,n)\) are appeared for the first time in this article. In Theorems 1.1 and 1.3, authors observed that the leading asymptotics of both \(b_{m,k}(n)\) and \(N_{k}(m,n)-N_{k}(m+1,n)\) are same and equal. Finally, all the results are proved in this article using proper mathematical tools, arguments and explanations.
      0 references
      theta functions
      0 references
      Fourier coefficients
      0 references
      uniform asymptotics
      0 references
      partitions
      0 references
      crank
      0 references
      rank
      0 references
      0 references

      Identifiers

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