The conjecture on the stable gap for sequential topological complexity of real projective spaces
Assume with , so is the length of the block of consecutive ones ending the binary expansion of . Let , and let be the stable value of the non-increasing sequence . Stable-gap conjecture. In Theorem 3.3 of the source, the equality holds without restriction on . This gives the asserted exact stable value for the gap between the dimensional upper bound and the zero-divisor-cup-length lower bound for sequential topological complexity. The source states that this conjecture has recently been proved, so the claim is solved.
References
Primary source
Jesus Gonzalez, Darwin Gutierrez and Adriana Lara, “Projective product coverings and sequential motion planning algorithms in real projective spaces”, arXiv:1605.07966 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.