ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m=8+12qm=8+12q with q=61+64dq=61+64d for some nonnegative integer dd. Define the sequence {gl}l≥10\{g_l\}_{l\ge 10} as in the preceding definition, with g10g_{10} and g10′g_{10}' selected according to the parity of dd, and with each subsequent pair determined by whether {gl−1′,Fm(gl−1′)}\{g_{l-1}',F_m(g_{l-1}')\} is a length-two cycle strongly growing at level ll. Strong growth conjecture. For every l≥10l\ge 10, the Fibonacci polynomial Fm(x)F_m(x) has a cycle {gl,Fm(gl)}\{g_l,F_m(g_l)\} of length 22 that strongly grows at level ll. The authors report computational evidence for many values of ll, but the apparently random sequence prevents a proof of strong growth and the conjecture remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.