2000 character limit reached
Log-concavity for partitions without sequences
Published 12 Jun 2023 in math.NT and math.CO | (2306.07459v2)
Abstract: We prove log-concavity for the function counting partitions without sequences. We use an exact formula for a mixed-mock modular form of weight zero, explicit estimates on modified Kloosterman sums and analytic techniques. Finally, we establish the higher Tur\'an inequalities in an asymptotic form of the aforementioned partition function using a well established criterion of Griffin, Ono, Rolen, and Zagier on the zeros of Jensen polynomials.
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.