Weak form of the Main Conjecture for circuit-array rows
Statement
Let and denote the entries in rows of the corresponding circuit arrays, and let and denote their numerators and denominators. A sequence satisfies a recursion when it has an associated annihilator polynomial in the shift operator. For each row , consider the sequences indexed by . Weak form of the Main Conjecture. Each of the sequences , , , and satisfies a recursion whose corresponding annihilator is a product, possibly with repetition, of linear factors of the form with . This is the weaker formulation of the paper's proposed description of the recursions governing the circuit-array rows; the source gives no general proof or resolution, although the stronger form would imply it.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.