← All problems

The coefficient-of-q2s−2q^{2s-2} conjecture for the Fibonacci polynomials Fs(q)F_s(q)

10 years old · traced to

Let Fs(q)F_s(q) be the recursively defined polynomials

F0(q)=1,F1(q)=1,Fs(q)=(1+q+2q2)Fs−1(q)+q3Fs−2(q)(s≥2).F_0(q)=1,\qquad F_1(q)=1,\qquad F_s(q)=(1+q+2q^2)F_{s-1}(q)+q^3F_{s-2}(q)\quad(s\ge2).

The coefficient-of-q2s−2q^{2s-2} conjecture. For all s≥2s\ge2, the coefficient of q2s−2q^{2s-2} in Fs(q)F_s(q) is the number of compositions of s+9s+9 into ss parts, none of which is 22 or 33, namely OEIS sequence A134465. The claim was verified computationally for s≤10s\le10 and remains open as stated.

References
  1. David Anderson, Eric S. Egge, Manda Riehl, Lucas Ryan, Ruth Steinke and Yuriko Vaughan, “Pattern Avoiding Linear Extensions of Rectangular Posets”, arXiv:1605.06825 (2016).

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.