Regularly spaced subsums of integer partitions
Abstract
For integer partitions λ :n=a1+...+ak, where a1 a2 >... ak 1, we study the sum a1+a3+... of the parts of odd index. We show that the average of this sum, over all partitions λ of n, is of the form n/2+(6/(8π))nn+c2,1n+O(n). More generally, we study the sum ai+am+i+a2m+i+... of the parts whose indices lie in a given arithmetic progression and we show that the average of this sum, over all partitions of n, is of the form n/m+bm,inn+cm,in+O(n), with explicitly given constants bm,i,cm,i. Interestingly, for m odd and i=(m+1)/2 we have bm,i=0, so in this case the error term is of lower order. The methods used involve asymptotic formulas for the behavior of Lambert series and the Zeta function of Hurwitz. We also show that if f(n,j) is the number of partitions of n the sum of whose parts of even index is j, then for every n, f(n,j) agrees with a certain universal sequence, Sloane's sequence #A000712, for j n/3 but not for any larger j.
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.