Complete-graph-cycle bridge-sum orbit-length conjecture

Let K(v_i){{% \mathchoice {\raisebox{-.1mm}{\includegraphics[height=2ex]{Bridge}}} {\raisebox{-.1mm}{\includegraphics[height=2ex]{Bridge}}} {\raisebox{-.6mm}{\includegraphics[height=2ex]{Bridge}}} {\raisebox{-.5mm}{\includegraphics[height=2ex]{Bridge}}} }} C(v_j) be a bridge \sum of a complete graph on nn vertices and a cycle graph on ν\nu vertices, and let wσw_\sigma be the winding-number parameter determined by the initial labeling σ\sigma. Complete-graph-cycle bridge-\sum conjecture. The orbit length of toric promotion on K(v_i){{% \mathchoice {\raisebox{-.1mm}{\includegraphics[height=2ex]{Bridge}}} {\raisebox{-.1mm}{\includegraphics[height=2ex]{Bridge}}} {\raisebox{-.6mm}{\includegraphics[height=2ex]{Bridge}}} {\raisebox{-.5mm}{\includegraphics[height=2ex]{Bridge}}} }} C(v_j) is

wσ(n+ν1)(n+ν).w_\sigma(n+\nu-1)(n+\nu).

The conjecture proposes a labeling-dependent formula for bridge sums with a cycle component, extending the paper's results for complete-graph bridge sums; it remains open.

Sources & referencesView supporting material

Primary source

Kerry Seekamp, “Orbits of toric promotion on bridge sums”, arXiv:2512.00692 (2025).

Progress summary

Never refreshed

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.