ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G\mathbf{G} be the countably infinite set of regular maps on the torus, where each G∈G\mathcal{G}\in\mathbf{G} is an embedded graph in the torus that is arc-transitive. For each G∈G\mathcal{G}\in\mathbf{G}, let BG\mathbf{B}_{\mathcal{G}} be the set of braid words formed from any number of braid generators defined on G\mathcal{G}, and let h‾(β)\overline{h}(\beta) denote the topological entropy per operation of β∈BG\beta\in\mathbf{B}_{\mathcal{G}}. Maximally efficient surface braid conjecture.

max⁡β∈BG, G∈Gh‾(β)=log⁡(ϕ+ϕ),\max_{\beta\in\mathbf{B}_{\mathcal{G}},\,\mathcal{G}\in\mathbf{G}}\overline{h}(\beta)=\log(\phi+\sqrt{\phi}),

where

ϕ=1+52.\phi=\frac{1+\sqrt{5}}{2}.

Furthermore, when extended to the plane using the periodicity of the pertinent torus model, all braid words β\beta for which h‾(β)=log⁡(ϕ+ϕ)\overline{h}(\beta)=\log(\phi+\sqrt{\phi}) 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.