The Bernoulli-number formula for the terminal coefficients pk,k−1(n)p_{k,k-1}(n)

At least 9 years old · documented by

Let t:=n(n+1)t:=n(n+1), and define pk,k−1(n):=pk,k−1(t)∣t=n(n+1)p_{k,k-1}(n):=p_{k,k-1}(t)|_{t=n(n+1)}. Suppose

pk,k−1(n)=ckvk(n)nk−1(n+1)k−1,p_{k,k-1}(n)=c_k\frac{v_k(n)}{n^{k-1}(n+1)^{k-1}},

where vk(n)v_k(n) is monic of degree 2k−22k-2. Let B2kB_{2k} denote the Bernoulli numbers, defined by

xex−1=∑r≥0Brxrr!.\frac{x}{e^x-1}=\sum_{r\geq 0}B_r\frac{x^r}{r!}.

Terminal-coefficient conjecture. The polynomials and constants are given by

vk(n)=∑q=12k−1(2kq)+(−1)q+12k+1n2k−q−1,v_k(n)=\sum_{q=1}^{2k-1}\frac{{2k\choose q}+(-1)^{q+1}}{2k+1}n^{2k-q-1},

and

ck=(−1)k+1(2k+1)2kB2k.c_k=(-1)^{k+1}(2k+1)2^kB_{2k}.

The formulas are conjectured from the displayed cases and are presented in the section on the conjectural relationship with simple symmetric Venn diagrams; the source gives no proof or resolution.

References

Primary source

Andrei K. Svinin, “Conjectures involving a generalization of the sums of powers of integers”, arXiv:1610.05387 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.