Deterministic binary enumeration of aligned bounded-diameter regions in the many-cluster branch
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.aligned_region_familyalgorithmsclusteringcomputational-complexity
Enumerate radius guesses and coverings with a good scenario for a stable many-large-cluster instance. At the correct guess each region is a union of optimal blocks and has diameter at most the density scale. Enumerate the boundedly many split balls and reinsert each as a separate region. This is the geometric front end of Section 4, independent of local optimization.
Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_RegionalTables import Definitions.Def_QuantumMaxCutFiniteNumericRuntime open OAI.MetricKMedian.Binary.Automatic open StableMSR.Recovery StableMSR.Recovery.Supplement StableMSR.Recovery.Supplement.BinaryRecovery open StableMSR.Recovery.Supplement.BinaryRecovery.Regional
Formal statement
theorem StableMSR.Recovery.Supplement.BinaryRecovery.Regional.aligned_region_family (γ : ℚ) (hγ : 1<γ) (hlt : γ<2) :
∃ (b : ℕ) (F : Input → List Scenario), Poly F ∧
∀ (I : RationalInput) (_ : I.Valid) (O : Partition I.n),
Stable I.dist I.k (γ:ℝ) O → I.k<I.n →
b < (largeClusters I.dist O ((γ:ℝ)-1)).card →
∃ s∈F (fieldsOf I), GoodScenario I O γ s := by
sorry
Source
S. Ravichandran and L. Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, Section 4.1 equation (2), Proposition 4.2 and Appendices A.4–A.6. https://arxiv.org/abs/2611.03547