Inequivalence conjecture for rooted spanning trees and initial states in de Bruijn sequence generation
Statement
Let be the feedback function defined from a nonsingular function in Equation, with . An input pair consists of a rooted spanning tree and an initial state, and two input pairs are distinct when either component differs. Inequivalence conjecture. Distinct input pairs generate inequivalent de Bruijn sequences of order under both the GPO and GJPO algorithms. This conjecture is motivated by computational evidence; its general validity for the stated feedback functions and parameter range remains open.
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.