Asymptotic growth of minimal-difference partitions via a variational principle
Journal of Combinatorial Mathematics and Combinatorial Computing · 22.07.2026 · 131 · 87-97
DOI: 10.61091/jcmcc131-06 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 22.07.2026. Verfasst von Yomi Anifowoshe und 1 weiteren Autor:innen.
Abstract (Originalsprache)
For a fixed integer \(k\geq0\), let \(p_k(n)\) denote the number of integer partitions \(\lambda=(\lambda_1,\ldots,\lambda_r)\) of \(n\) satisfying the minimal-difference condition \(\lambda_i-\lambda_{i+1}\geq k,\quad 1\leq i0\) the unique solution of \(1-e^{-x_k}=e^{-kx_k}\). The case \(k=0\) is stated separately and gives the classical Hardy–Ramanujan constant \(B_0=\pi\sqrt{2/3}\). The proof combines a uniform Euler–Maclaurin estimate for the truncated Euler product, a discrete Laplace principle for the length sum, and Ingham’s Tauberian theorem.
Zitieren
APA
Anifowoshe, Y., & Etchegaray, T. (2026). Asymptotic growth of minimal-difference partitions via a variational principle. Journal of Combinatorial Mathematics and Combinatorial Computing, 131, 87-97. https://doi.org/10.61091/jcmcc131-06
Vancouver
Anifowoshe Y, Etchegaray T. Asymptotic growth of minimal-difference partitions via a variational principle. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;131:87-97. doi:10.61091/jcmcc131-06
BibTeX
@article{Anifowoshe2026,
author = {Anifowoshe, Yomi and Etchegaray, Thomas},
title = {Asymptotic growth of minimal-difference partitions via a variational principle},
journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
year = {2026},
volume = {131},
pages = {87--97},
doi = {10.61091/jcmcc131-06}
}
EUVIMED