Graph and wreath products in topological full groups of full shifts

The paper proves that for every finite alphabet Σ (|Σ| ≥ 2), every right-angled Artin group (including those from countable graphs) embeds in the topological full group JΣ^ZK, via a conveyor-belt simulation and a graph-product closure with linear look-ahead, culminating in Theorem 1 and Theorem 3. The candidate solution reproduces essentially the same construction: mutually unbordered markers carve configurations into conveyor belts; per-vertex cocycles move a head along color-coded edges; commuting relations are enforced locally; injectivity is shown via a graph-product normal form. Minor presentational differences aside (e.g., where to place “shared cells”), the core mechanism, look-ahead analysis, and faithfulness argument are the same in spirit. The paper’s proofs are complete and rigorous, while the candidate’s write-up is a faithful proof sketch with a few details glossed over.