The orbit-bound conjecture for shortest surjective strategies

From papers

Let K/HK/H be the set of equivalence classes of KK under the action of HH, and let NN denote the length of a surjective strategy. Orbit-bound conjecture. If GHG\wr H has a surjective strategy, then it has a surjective strategy of length N<2K/H1N<2^{|K/H|-1}. This is a weaker alternative to the minimal-strategy conjecture, providing an exponential upper bound in the number of HH-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

No solutions have been posted yet.