The maximally efficient surface braid conjecture
Statement
Let be the countably infinite set of regular maps on the torus, where each is an embedded graph in the torus that is arc-transitive. For each , let be the set of braid words formed from any number of braid generators defined on , and let denote the topological entropy per operation of . Maximally efficient surface braid conjecture.
where
Furthermore, when extended to the plane using the periodicity of the pertinent torus model, all braid words for which represent the same braid up to conjugacy and time-reversal symmetry. This conjecture asserts both the maximal topological entropy per operation among braid words on regular torus maps and uniqueness, up to the stated symmetries, of the maximizers.
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.