Enumerating bounded-diameter binary partitions that split only boundedly many optimal blocks
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.few_split_binary_familyalgorithmsclusteringcomputational-complexity
The geometric ingredient before any repair: enumerate radius guesses and small-diameter partitions, one of which cuts only a bounded number of optimal blocks. In the paper the bound is F_ε, the diameter is at most the density scale, and every small optimal cluster survives. This statement needs only the total number of split blocks.
Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_RegionRepair 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.few_split_binary_family (γ : ℚ) (hγ : 1<γ) (hlt : γ<2) :
∃ (b h : ℕ) (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), Seed I O γ h 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