2000 character limit reached
Inequalities related to the coefficients of the $j$-function
Published 24 Jun 2025 in math.CO and math.NT | (2506.19292v1)
Abstract: In recent years, the log-concavity or log-convexity of combinatorial sequences and their root sequences, higher order Tur{\'a}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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.