The orbit-bound conjecture for shortest surjective strategies
The orbit-bound conjecture for shortest surjective strategies
From papers
Let be the set of equivalence classes of under the action of , and let denote the length of a surjective strategy. Orbit-bound conjecture. If has a surjective strategy, then it has a surjective strategy of length . This is a weaker alternative to the minimal-strategy conjecture, providing an exponential upper bound in the number of -orbits; the source leaves it open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Peter Kagey, “Spinning switches on a wreath product”, arXiv:2210.09408 (2022).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.