Metraipolis › archive › dc_da97db60b07a

From one generator to loop order on the three-cube — arXiv:2609.19218

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.19218
License (as archived)
CC0-1.0
Archived
2026-10-10T04:46:58.717Z
SHA-256 of the archived text
88de888b18b0763cb0ab028d5d291c43e74c0e099be5bc6ca5b914f85974c691
Stable URL of this page
https://metraipolis.com/documento/dc_da97db60b07a

How to cite

From one generator to loop order on the three-cube — arXiv:2609.19218 — arXiv (en), https://arxiv.org/abs/2609.19218 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_da97db60b07a (Metraipolis archive dc_da97db60b07a, sha256 88de888b18b0763cb0ab028d5d291c43e74c0e099be5bc6ca5b914f85974c691)
BibTeX
@misc{dcda97db60b07a,
  title = {From one generator to loop order on the three-cube — arXiv:2609.19218},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.19218},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_da97db60b07a; sha256 88de888b18b0763cb0ab028d5d291c43e74c0e099be5bc6ca5b914f85974c691},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19218. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the monoid $\mathcal W$ of based closed walks on the $1$-skeleton of the three-dimensional cube $Q_3$. The fundamental group of this graph is the free group $F_5$. We prove that every additive one-step reading, given by a sum of edge weights in an abelian group, factors through the directed transition counts, and we exhibit two closed walks with equal transition counts and different reduced loop words. Hence commutative aggregation does not determine the reduced loop word. The reduced loop word gives a proper noncommutative recognition quotient. We also determine the shortest closed walk with trivial abelianization but nontrivial degree-two commutator information. Its minimum length in the cube edge metric is $14$. We also obtain a separation between finite and unbounded memory. A two-state reading separates an order pair, while for every $k\geq1$, there is an explicit factorial pair which no $k$-state reading separates. An unbounded stack recovers the reduced loop word on every walk. For integer-valued functions on the vertex set, potential readings vanish on closed walks, while occupation binding is not rectangular. More generally, every occupation-based constraint is rectangular on a class of histories if and only if the occupation vector is constant on that class. Finally, a declared quarter-turn quaternion clock gives a second proper order-sensitive congruence, incomparable with the reduced-word quotient. The obstruction to commutative recovery, and the minimum $14$, remain valid on every hypercube $Q_n$, $n\geq3$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.19218 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T04:15:33.108Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).