gap forbidden application
ProvedFreiman.gap_forbidden_applicationfreimangaphall-ray
Use strict cylinder semantics at each witness coordinate; reflection gives the reversed forbidden words.
Preamble
import Definitions.Def_Freiman_gapModel
Formal statement
namespace Freiman theorem gap_forbidden_application (words : List (List ℕ+)) (hchecks : ∀ w ∈ words, ∃ j : ℕ, j < w.length ∧ (4527829567/1000000000 : ℚ) ≤ gapCylinderLower w j) (a : ℤ → ℕ+) (hc : gapCapped a) : ∀ w ∈ words, gapAvoids a w := by sorry end Freiman
Source
Freiman Hall ray report, m3_maximum.tex and m3_minimum.tex; forbidden-word tables