Existence of 1-Gray codes for Fibonacci q-decreasing words
Statement
Let and , and let denote the set of Fibonacci -decreasing words of length . A 1-Gray code for is an ordering of its words in which consecutive words differ in exactly one position. The 1-Gray code conjecture. For any and , there is a 1-Gray code for . The conjecture extends the established construction for the case ; the paper notes that the parity condition and experiments for and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.