English

Estimates on binomial sums of partition functions

Number Theory 2026-01-15 v1

Abstract

Let p(n)p(n) denote the partition function and define p(n,k)=j=0k(njkj)p(j)p(n,k)=\sum_{j=0}^{k}\binom{n-j}{k-j}p(j) where p(0)=1p(0)=1. We prove that p(n,k)p(n,k) is unimodal and satisfies p(n,k)<2.825n2np(n,k) < \frac{2.825}{\sqrt{n}}\, 2^n for fixed n1n\ge 1 and all 1kn1\le k\le n. This result has an interesting application: the minimal dimension of a faithful module for a kk-step nilpotent Lie algebra of dimension nn is bounded by p(n,k)p(n,k) and hence by 3n2n\frac{3}{\sqrt{n}}\, 2^n , independently of kk. So far only the bound nn1n^{n-1} was known. We will also prove that p(n,n1)<nexp(π2n/3)p(n,n-1)<\sqrt{n}\exp(\pi\sqrt{2n/3}) for n1n\ge 1 and p(n1,n1)<exp(π2n/3)p(n-1,n-1)<\exp (\pi\sqrt{2n/3} ).

Keywords

Cite

@article{arxiv.2601.09472,
  title  = {Estimates on binomial sums of partition functions},
  author = {Dietrich Burde},
  journal= {arXiv preprint arXiv:2601.09472},
  year   = {2026}
}
R2 v1 2026-07-01T09:04:18.778Z