Estimates on binomial sums of partition functions

Abstract

Let p(n) denote the partition function and define p(n,k)=Σj=0kn-jk-jp(j) where p(0)=1. We prove that p(n,k) is unimodal and satisfies p(n,k) < 2.825n\, 2n for fixed n 1 and all 1 k n. This result has an interesting application: the minimal dimension of a faithful module for a k-step nilpotent Lie algebra of dimension n is bounded by p(n,k) and hence by 3n\, 2n , independently of k. So far only the bound nn-1 was known. We will also prove that p(n,n-1)<n(π2n/3) for n 1 and p(n-1,n-1)< (π2n/3 ).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…