# Job #576 (explore): prior-art hunt for return #161 — `L(T_x,p)`, the longest adjacent-kill run ## Verdict **novel to us.** Every ingredient of `L` is owned and the owners are *already named in this project's own registers*, so the brief's middle verdict is the correct one: the record names an owner for each part, and no source states the object. I located no paper that states `L`, its run spectrum, its diagonal, or its `p0` thresholds. Two rows of `research/SEARCH-CONVENTIONS.md` already carry this object — row 87 for the mechanism (`L`, "adjacent-kill run"; Holt's fusion condition) and row 99 for the run law ("owns the RANDOM-word law only; the longest legal factor of ONE given periodic word is posed nowhere") — and `research/IMPORT-MAP.md` row 2 already names the language owner. **No new import row and no new convention row are owed.** What this job adds is the *reason* the object has no home (§5), which is not recorded, and a full independent reproduction of #161's own new numbers (§2). ## 1. The object, and the criterion that removes the residues Return #161 measures `L(T_x,p)` — "the longest run of consecutive slots of `T_x` whose residues mod `p` lie in a 2-set `{a, a+2}` for any `a`, with the wraparound difference `p-2` admitted". A slot of `T_x` is killed by the fold at `p` iff its residue is `0` or `-2` mod `p`. Two consecutive slots at distance `g` are both killed iff both residues land in the same 2-set, and their residues differ by `g`, so the condition is **on the gap alone**: > **`L(T_x,p) = 1 +` (the longest run of consecutive QUALIFYING gaps of the one-period gap word of > `T_x`, taken cyclically), where a gap `g` is qualifying when `g ≡ 0, ±2 (mod p)`.** This is the project's own lemma in `research/kappa-not-L.md` ("two adjacent slots at distance `g` can both be deleted by the fold at `p` only if `g ≡ 0 or ±2 (mod p)`, PROVEN in one line from the strike classes") read as a run-length statement; the derivation here is a re-derivation, and it is what the verification script implements rather than the residue walk. Two consequences used below. Every gap is a multiple of 6 (`x ≥ 5`), so the smallest qualifying gap is exactly `2p∓2` (`p ≡ 1`: `2p-2`; `p ≡ 5`: `2p+2`), then `4p±2`, then `6p` — verbatim the closed form already in `kappa-not-L.md`, checked at eleven primes in `lruns3.out`. And since `T_x`'s gaps are at most `G₂(T_x)`, **no gap can qualify once `2p∓2 > G₂`**, which is why `L` collapses to 1 at a threshold near `(G₂+2)/2`. ## 2. Independent recomputation of #161's new numbers (verified, not prior art) `lruns3.mjs` (sha256 `5846a964…`) builds each tile's slot set by CRT expansion (`t ≢ 0, -2 mod p` for every `p ≤ x`), sorts it, forms the cyclic gap word, and applies §1. 18 s, one core, one process. | tile | `W` | `D` | `G₂` | `p0` found | #161 | max `L` found | |---|---|---|---|---|---|---| | T5 | 30 | 3 | 12 | **11** | 11 | 3 (p=5) | | T7 | 210 | 15 | 30 | **11** | 11 | 3 (p=7) | | T11 | 2310 | 135 | 42 | **23** | 23 | 2 (p=11) | | T13 | 30030 | 1485 | 66 | **37** | 37 | 2 (p=13) | | T17 | 510510 | 22275 | 108 | **59** | 59 | 3 (p=23) | | T19 | 9699690 | 378675 | 150 | **71** | 71 | 3 (p=23) | | T23 | 223092870 | 7952175 | 204 | **107** | 107 | 4 (p=23) | `p0` = the smallest prime such that `L(T_x,q) = 1` for every prime `q` in `[p0, 1009]`, computed as the first prime after the last prime at which `L > 1`. **All seven reproduce.** **The T23 dip reproduces line for line.** #161: "T23's dip to 1 at p = 71, 73 and return to 2 at 79 to 103". Mine: `67:2 71:1 73:1 79:2 83:2 89:2 97:2 101:2 103:2 107:1`. The dips are forced by the criterion, not by scarcity: at `p = 71` only a gap of exactly `144 = 2p+2` can qualify (`4p-2 = 282 > 204`), and T23's gap word has no 144; `p = 107` is the first prime past `2·103`. **The `G₂` column is the project's own ladder** (`30, 42, 66, 108, 150, 204` at T7…T23), reproduced independently of any served script — this is a second, CRT-based route to it. **#161's seam claim holds.** It asserts "B linear against B cyclic: 0 (the tile seam never moves L here)". My two readings (cyclic = the step closing the period allowed; linear = forbidden) agree at **0 disagreements in 1148 entries** (7 tiles × every prime from `x` to `1009`; 167+166+165+164+163+162+161 = 1148). Not reproduced here: the **T29 column** and the **T37 / 1,307-entry sweep**. T29 needs the 214,708,725-slot build; I did not spend the memory. Everything I did check of #161 stands, including its own caution that method A is greedy while method B is exact. ## 3. The owning conventions, named | convention | what it owns there | source | how far it covers `L` | |---|---|---|---| | **cycles of gaps / constellations / driving terms** of Eratosthenes sieve | the gap word itself, the fusion recursion, and the *populations* of patterns of consecutive gaps | Holt–Rudd, *Eratosthenes sieve and the gaps between primes*, arXiv:1408.6002 (2014) §5, §6.1; Holt, *Combinatorics of the gaps between primes*, arXiv:1510.00743; Holt, *Eratosthenes sieve supports the k-tuple conjecture*, arXiv:2502.20470v3 **§3 Lemma 2 (p. 5)** | the mechanism only. "The fusions at `γ_i` and `γ_j` occur in the same image of `s` iff `p` divides the span" is the `g ≡ 0` case of §1. Holt counts **how many** instances a constellation has, never **how long the longest qualifying run in one cycle** is. This is the convention to keep searching for `L` | | **constrained coding / symbolic dynamics** | the alternation language: strict soficity and the capacity | Marcus–Roth–Siegel, *Introduction to Coding for Constrained Systems*, §1.5.4 pp. 15–17, **§2.3 p. 47**, **§3.2 p. 75** (`λ = 2cos(π/(B+2))`; the ternary variant adds 1, giving `ln 2`) | the language only, and only after the lemma has been applied; **already recorded for this object** (IMPORT-MAP row 2) | | **longest-run laws** | the *random*-word distribution of the longest run | Flajolet–Sedgewick, *Analytic Combinatorics* Prop. V.2 (**already cited in IMPORT-MAP row 2**); Vaggelatou, *Statist. Probab. Lett.* (2003); Fu–Wang–Lou, *J. Appl. Probab.* (2003); Eryilmaz, *Appl. Math. Comput.* (2006) | nothing for a **given** word: these are distributions under a random model, not the maximum over one fixed periodic word. Row 99 already says exactly this | | **Jacobsthal-type covering / max-gap functions** | `G₂` = the maximum gap of the twin-admissible set | OEIS **A144311** (Carter, Sep 2008); Ziller–Morack, arXiv:1706.00317 **Thm 4.1**; paired Jacobsthal `h₂` = OEIS **A288815** | a different statistic — a *maximum gap*, not a run of adjacent kills. `L` is not a Jacobsthal value | | **runs of consecutive integers with a common arithmetic property** (a live genre) | run lengths of a multiplicative condition along consecutive integers | Spătaru, *Runs of consecutive integers having the same number of divisors*, arXiv:2301.04464 (= PUMP 2023); Kimmel, *Consecutive runs of sums of two squares*, JNT 2024 | a real convention for run-length statistics in number theory, but the run set is consecutive **integers** under a multiplicative condition, never consecutive **gaps** of a sifted set. Worth knowing; does not own `L` | ## 4. The searches run Own-wording negatives are worthless, so each family was run in the vocabulary the owning convention actually uses: 1. **Constellation / driving-term vocabulary** — "cycles of gaps", "driving terms", "constellation", "fusion", "span", "closures" + run/consecutive → the Holt corpus (1408.6002, 1510.00743, 1312.2165, 2502.20470, 2309.16833) and nothing else. 2. **Constrained-coding vocabulary** — "charge-constrained", "dc-free", "running digital sum", "digital sum variation", "B-charge constraint", "alternate mark inversion", "maximum runlength", "longest run in a constrained sequence" → the B–(d,k) charge–RLL design literature (e.g. *Channel capacity of charge-constrained run-length limited codes*), which treats `(d,k)` and `B` as design parameters and studies capacities and codebooks, not the longest run of a *supplied* word. 3. **Run-length genre vocabulary** — "runs of consecutive integers", "longest run" + sieve / divisors / coprime / primorial → Spătaru 2023, Kimmel 2024, De Koninck et al.; the genre above. The Jacobsthal vocabulary returned Hagedorn's computation papers and Hajdu–Saradha's disproof, all about `j(n)` (max gap), none about runs of adjacent covered elements. 4. **OEIS** — the diagonal `2,1,2,2,2,3,2,4` returns 36 entries, all subsequence coincidences (Champernowne first); no entry carries `L`, the run spectrum, or the `p0` thresholds. A144311 and A288815 remain the only entries in the family. **Owed channels, stated rather than papered over:** MathSciNet / zbMATH review text, and Google Scholar's **forward citations of Holt–Rudd arXiv:1408.6002**. The second is the single most likely place a "longest qualifying run" statistic would already appear if one exists; it is the first thing a successor should open. ## 5. Why the object has no home (checked, and the useful half of the answer) The covering literature owns "the longest run of consecutive integers each divisible by at least one prime of a set". For a **single** modulus that object is degenerate, for a reason `L` cannot escape: > For every prime `p ≥ 5` and every `a`, **no two consecutive integers both lie in `{a, a+2} (mod p)`**. > `lruns3.mjs` part A: 0 such pairs over all primes `p ∈ [5, 1000]` and all `a`. So the single-modulus covering run on `ℤ` is identically 1, and there is nothing there for the covering convention to own. `L > 1` exists only because the ambient set is the **sifted** set `T_x`, whose slots skip integers: the two killed residues `{0, -2} mod p` cannot be adjacent in `ℤ`, but their preimages in `T_x` can be adjacent *in the slot order*. The object therefore sits at the intersection of the covering convention and the constellation convention, and **neither owns the intersection**. That is the structural form of the negative: a search in either convention alone finds nothing, and that is expected rather than evidence of a gap in the search. ## 6. Rungs - `L(T_x,p) = 1 +` longest cyclic run of qualifying gaps: **derived** (one line from the strike classes, and it is the project's own lemma restated), cross-checked against the recorded closed form for the qualifying gaps at 11 primes. - The seven `p0` thresholds, the T23 dip, the `G₂` ladder and the seam claim: **verified** — a finite computation ran and matched #161 on this machine, range stated (T5–T23, `x ≤ p ≤ 1009`, 1148 entries, one core, 18 s). - The degeneracy of the single-modulus run: **verified** (exhaustive over `p ∈ [5,1000]`). - The prior-art verdict: **scoped negative** — "not located", never "absent". Conventions named, searches listed, two channels stated unread. ## 7. Recommendation, not a request The one thing worth recording that is not: a caution for row 99 / §3 of `research/SEARCH-CONVENTIONS.md` — *do not search the covering-run convention for `L`: the single-modulus run is degenerate on `ℤ` (no two consecutive integers, `p ≥ 5`), so `L` exists only relative to the sifted set; the convention to search is the constellation / driving-term one.* I have **not** filed the revised served file; the explore return is the deliverable this brief asks for, and the edit is a whole-file revision of an 81 KB document that belongs to whoever owns the register. ## Files and hashes `lruns3.mjs` sha256 `5846a964281578f3ab568ccaa37059c76117be90fd18dcbc7f35f61e53009acb`; `lruns3.out` sha256 `99cf16b90aad1b6b747d324fd0143ec66f95a399e6eb9f82dfdccf9a3df4eee0`; `searches.md` (the search log, with the queries and the negative for each). `lruns.mjs` and `diag7.mjs` are the first, superseded attempts: `lruns.mjs` mishandles the period seam (it steps from the last slot to the first without adding `W`), which is exactly the error that produced a spurious `L(T7,11) = 2` and a wrong T7 threshold. They are kept because the failure is the most likely one a reimplementer will make, and `diag7.mjs` shows it in eight lines.