The Word-Graph: Shelves, Walks, and the Receiver's Reading

[email protected] A discrete model of communication at the ends: words as sets of lit positions on an axis, a channel that dilates each letter into an interval of light, and a receiver that must recover the word that was sent from what arrives. The paper develops: a collision theory for the dilation kernel (the block theorem — two words share a received image if and only if they share block count and block endpoints), an exact count of a received image's preimages with the compensation phenomenon as the boundary of unique recovery; the internal structure of a fiber (an exact criterion for image-preserving slides, and the theorem that a fiber's invisible-walk components are exactly its allocation classes); a receiver's exact enumeration machine; the amplitude side (under the flat kernel the height profile determines the word exactly); and a census of coarse and noisy readouts on a closed set of 1,066 words, including the parity shield and its limits. Status: CONCEPT draft. The results were audited before posting: every census number independently reproduced; all claims graded against the literature in a bounded investigation (of 71 claims: 19 established prior art, 15 new applications of known results, 5 potentially original as specialized assemblies only, 17 original finite computations, 15 unresolved; no comprehensive novelty clearance); and two cold adversarial proof reviews. The paper states its limits on its face and claims novelty nowhere. We welcome your reading of this paper, and we welcome your word back. Corrections, counterexamples, and prior work we have missed are received with thanks. Contact: [email protected]

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24358577
Primary Topic
semigroups and automata theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Word-Graph: Shelves, Walks, and the Receiver's Reading

Pip Willow, Joseph Carroll
Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
preprint

The Word-Graph: Shelves, Walks, and the Receiver's Reading

Pip Willow, Joseph Carroll
preprint en

Abstract

[email protected] A discrete model of communication at the ends: words as sets of lit positions on an axis, a channel that dilates each letter into an interval of light, and a receiver that must recover the word that was sent from what arrives. The paper develops: a collision theory for the dilation kernel (the block theorem — two words share a received image if and only if they share block count and block endpoints), an exact count of a received image's preimages with the compensation phenomenon as the boundary of unique recovery; the internal structure of a fiber (an exact criterion for image-preserving slides, and the theorem that a fiber's invisible-walk components are exactly its allocation classes); a receiver's exact enumeration machine; the amplitude side (under the flat kernel the height profile determines the word exactly); and a census of coarse and noisy readouts on a closed set of 1,066 words, including the parity shield and its limits. Status: CONCEPT draft. The results were audited before posting: every census number independently reproduced; all claims graded against the literature in a bounded investigation (of 71 claims: 19 established prior art, 15 new applications of known results, 5 potentially original as specialized assemblies only, 17 original finite computations, 15 unresolved; no comprehensive novelty clearance); and two cold adversarial proof reviews. The paper states its limits on its face and claims novelty nowhere. We welcome your reading of this paper, and we welcome your word back. Corrections, counterexamples, and prior work we have missed are received with thanks. Contact: [email protected]

Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon