ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CrX(j)C^X_r(j) and CrM(j)C^M_r(j) denote the entries in rows rr of the corresponding circuit arrays, and let NumNum and DenDen denote their numerators and denominators. A sequence satisfies a recursion when it has an associated annihilator polynomial in the shift operator. For each row r∈{2(c−1),2(c−1)−1}r \in \{2(c-1),2(c-1)-1\}, consider the sequences indexed by j≥cj \ge c. Weak form of the Main Conjecture. Each of the sequences Num[CrX(j)]Num[C^X_r(j)], Den[CrX(j)]Den[C^X_r(j)], Num[CrM(j)]Num[C^M_r(j)], and Den[CrM(j)]Den[C^M_r(j)] satisfies a recursion whose corresponding annihilator is a product, possibly with repetition, of linear factors of the form X−9kX-9^k with k≥0k \ge 0. 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 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.