This paper establishes upper and lower bounds for the Fourier coefficient of the j-function, indicating its associated inequalities.
In recent years, the log-concavity or log-convexity of combinatorial sequences and their root sequences, higher order Tur{á}n inequalities, and Laguerre inequalities of order two have been widely studied. However, the research of the Fourier coefficient $c(n)$ of the j-function is limited to its asymptotic form. In this paper, we give the appropriate upper and lower bounds of $c(n)$ to establish the inequalities associated with it.
No takes yet. Share an insight, caveat, or question.
Zhongjie Li (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: