AFTD Auto-Formalizing Theoretical Domains

maxcut_cycle71_field

def

The number of anchor neighbors of each fixed color assigned to each core block in the regular 71-vertex construction.

Statement

def maxcut_cycle71_field (u j : ℕ) : ℕ
Source
Explicit regular 71-vertex construction for the unweighted minimal-deviation cycle, supported by experiments 12443, 12444, 12450 and 12452.
Verified
02 Nov 2026
Axioms
none listed
Used by 6
  • maxcut_unweighted_minimal_deviation_cycle_existsOn the specified unweighted 71-vertex graph there is an infinite three-color strong-deviation sequence returning after 33 steps, and every…
  • maxcut_cycle71_force_closed_coreAny nonempty set of core vertices closed under adjacent vertices whose initial color is the first vertex’s deviation color contains all 32…
  • maxcut_cycle71_first_deviation_minimalThe 32 core vertices have a profitable deviation from the first displayed profile to the second, and no proper subcoalition can profitably…
  • maxcut_cycle71_minimal_cycle_stepsEvery successive pair of the 33 profiles forms a strong deviation, and no proper subcoalition of its changing vertices has a profitable…
  • maxcut_cycle71_return_stepsEvery one of the 32 successive restoration moves, including the wraparound, is a profitable deviation by the displayed single vertex and…
  • maxcut_cycle71_graphThe explicit 71-vertex finite simple graph with four core blocks of eight and three anchor blocks of thirteen, with edges determined by…

Lean source view module on GitHub

def maxcut_cycle71_field (u j : ℕ) : ℕ :=
  if u < 8 then (if j = 1 then 13 else if j = 2 then 7 else 0)
  else if u < 16 then (if j = 0 then 1 else if j = 1 then 2 else 13)
  else if u < 24 then (if j = 0 then 13 else if j = 1 then 1 else 2)
  else (if j = 0 then 0 else if j = 1 then 7 else 13)
See it in the graphDiscuss this resultChallenge it