Sign-alternation conjecture for the flat Bernoulli game coefficients

At least 23 years old · documented by

Let ana_n be the coefficient of tn/n!t^n/n! in 1/(1−ln⁡(1+t))1/(1-\ln(1+t)), so that for n≥1n\geq 1,

an=(−1)n(Kn−nKn−1)=(−1)nκn+1−(n+1)κnn+1.a_n=(-1)^n\left(K_n-nK_{n-1}\right)=(-1)^n\frac{\kappa_{n+1}-(n+1)\kappa_n}{n+1}.

The first 1111 entries are positive, while a12a_{12} is negative and the subsequent entries appear to have alternating signs. Sign-alternation conjecture. For n≥12n\geq 12,

nκn−1>κn.n\kappa_{n-1}>\kappa_n.

Equivalently, nKn−1>KnnK_{n-1}>K_n holds for n≥11n\geq 11. This is the conjectured continuation of the observed alternation in the coefficient sequence associated with the flat Bernoulli game; the supplied text gives no resolution of the conjecture.

References

Primary source

Gábor Hetyei, “Enumeration by kernel positions for strongly Bernoulli type truncation games on words”, arXiv:0912.0573 (2009).

Additional references

2 papers in this index state this conjecture (2002–2009). The statement above is taken from the most recent of them; the others are arXiv:math/0202304.

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.