ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be the length of the vector c⃗=(c1,…,ck)\vec{\mathbf{c}}=(c_1,\ldots,c_k), and let the algorithm in the proof of Theorem main be the conversion algorithm for c⃗\vec{\mathbf{c}}-representations. A vector is weakly decreasing if ci+1≤cic_{i+1}\leq c_i for every 1≤i<k1\leq i<k. Termination conjecture. If k=3k=3, the algorithm terminates when ci≥0c_i\geq 0 for all 1≤i<31\leq i<3, ci+1−ci≤1c_{i+1}-c_i\leq 1 for all 1≤i≤k−11\leq i\leq k-1, and ck=1c_k=1. If there exists 1≤i<31\leq i<3 such that ci+1−ci≥2c_{i+1}-c_i\geq 2, then there is a c⃗\vec{\mathbf{c}}-representation for which the algorithm fails to terminate. If k≥4k\geq 4, the algorithm terminates if and only if c⃗\vec{\mathbf{c}} is weakly decreasing. The conjecture proposes a precise characterization of when this conversion algorithm terminates; the preceding example shows nontermination for c⃗=(1,3,1)\vec{\mathbf{c}}=(1,3,1), while the asserted general cases remain unresolved in the supplied source.

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.