A note on partition sum polynomials (Q2462319): Difference between revisions

In the present paper the authors consider the following problem: how to partition the set \(\{\frac{k!}{p_0!p_1!...p_{n-2}!}\mid p_i\geq 0, p_0+...+p_{n-2}=k\}\) such that the differences between sums of partitions are at most \(1\)? In particular, for \(n=3\), the authors' main result implies that the sum \({k\choose i}+{k\choose{i+3}}+{k\choose{i+6}}+\dots\) equals \(\frac{2^k-(-1)^k}{3}+\delta(k)(-1)^k\), where \(\delta(k)=1\) if \(i\equiv(-k)\pmod 3\) and \(\delta(k)=0\) otherwise. In addition, for \(n\neq 3\), they study how close to \(2^k/n\) the sum \({k\choose i}+{k\choose{i+n}}+{k\choose{i+2n}}+\dots\) could be.