Estimates on binomial sums of partition functions

preprint2026arXivOpen access

Abstract

Let p(n)p(n) denote the partition function and define p(n,k)=∑j=0k(n−jk−j)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.825n 2np(n,k) < \frac{2.825}{\sqrt{n}}\, 2^n for fixed n≥1n\ge 1 and all 1≤k≤n1\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 3n 2n\frac{3}{\sqrt{n}}\, 2^n , independently of kk. So far only the bound nn−1n^{n-1} was known. We will also prove that p(n,n−1)<nexp⁡(π2n/3)p(n,n-1)<\sqrt{n}\exp(π\sqrt{2n/3}) for n≥1n\ge 1 and p(n−1,n−1)<exp⁡(π2n/3)p(n-1,n-1)<\exp (π\sqrt{2n/3} ).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.