ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥0n\geq 0 and q≥1q\geq 1, and let Wnq\mathcal{W}^q_n denote the set of Fibonacci qq-decreasing words of length nn. A 1-Gray code for Wnq\mathcal{W}^q_n is an ordering of its words in which consecutive words differ in exactly one position. The 1-Gray code conjecture. For any n≥0n\geq 0 and q≥1q\geq 1, there is a 1-Gray code for Wnq\mathcal{W}^q_n. The conjecture extends the established construction for the case q=1q=1; the paper notes that the parity condition and experiments for 0≤n≤50\leq n\leq 5 and 2≤q≤52\leq q\leq 5 support it, but no general construction is given.

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.