Log-concavity for partitions without sequences
Number Theory
2025-04-03 v2 Combinatorics
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.
Keywords
Cite
@article{arxiv.2306.07459,
title = {Log-concavity for partitions without sequences},
author = {Lukas Mauth},
journal= {arXiv preprint arXiv:2306.07459},
year = {2025}
}
Comments
31 pages. Gave a new extended proof of the main result. Proof uses help of computer in certain places (see code attached for details)