Max-Cut to 2-adic Regression Visualizer

A small interactive sketch of the reduction: assign each vertex a binary value beta_j in {0,1}, then compare cut size against the constructed 2-adic regression objective.

Back to hub

Forcing weight M (must be > m)

Graph and Edge Types

Reduction Arithmetic

Here, each edge contributes |1 - beta_u - beta_v|_2, and each vertex contributes a constant M via forcing points. So total loss is L = M*n + m - cutsize.