Bounded periodic density base through eight tasks
ProvedRealPinwheel.FiveSixths.bounded_density_basepinwheel-schedulingreal-periods
Let be a nonempty ordered real-period instance of dimension , with all periods at least one. If its density satisfies , then it admits a valid periodic schedule with a positive integer period satisfying
Validity requires every task to occur at least times in every window of days, for every positive integer . This is the bounded periodic form of Lemma 5 supplied by the certificate families and Table 1; it retains the witnesses needed in Theorem 3.
Preamble
import Definitions.Def_RealPinwheel_FiveSixths_Instance open RealPinwheel.FiveSixths
Formal statement
theorem RealPinwheel.FiveSixths.bounded_density_base {n : ℕ} (A : Instance n) (hn : n ≤ 8)
(hD : density A ≤ (5 : ℝ) / 6) :
∃ (L : ℕ) (S : ℕ → Fin n), 0 < L ∧ L < 4 * 2 ^ n ∧
(∀ t, S (t + L) = S t) ∧ Valid A.period S := by sorrySource
Fujiwara, Gutowski, Ouchi and Wolff, A Simple Computer-Assisted Proof of the 5/6-Bound for Real-Period Pinwheel Scheduling, STOC 2027 submission #885, October 2026, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/885.pdf, Lemma 5 and Section 4, Table 1, printed pp. 10–11 (PDF pp. 11–12)