Metraipolis › archive › dc_b0776fda97ba
Strong Topological Rokhlin Property: Finite-Index Ascent, Descriptive Complexity, and Effective Obstructions — arXiv:2608.18485
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.18485
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T14:00:00.607Z
- SHA-256 of the archived text
6ff61f9b8e89de4de367c15538638cbdc0dd5989c259d5212c79ed7c0d2412b6- Stable URL of this page
https://metraipolis.com/documento/dc_b0776fda97ba
How to cite
Strong Topological Rokhlin Property: Finite-Index Ascent, Descriptive Complexity, and Effective Obstructions — arXiv:2608.18485 — arXiv (en), https://arxiv.org/abs/2608.18485 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b0776fda97ba (Metraipolis archive dc_b0776fda97ba, sha256 6ff61f9b8e89de4de367c15538638cbdc0dd5989c259d5212c79ed7c0d2412b6)
BibTeX
@misc{dcb0776fda97ba,
title = {Strong Topological Rokhlin Property: Finite-Index Ascent, Descriptive Complexity, and Effective Obstructions — arXiv:2608.18485},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.18485},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b0776fda97ba; sha256 6ff61f9b8e89de4de367c15538638cbdc0dd5989c259d5212c79ed7c0d2412b6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18485. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We give a finite symbolic characterization of the strong topological Rokhlin property in terms of globally realizable finite pattern systems. We use this characterization to prove finite-index ascent: if $H\leq G$ has finite index, $G$ is finitely generated, and $H$ has STRP, then $G$ has STRP. Consequently every finitely generated virtually free group has STRP, whereas among countable locally virtually free groups STRP holds exactly for the finitely generated ones. In the compact coding space $\operatorname{NSub}(F_\omega)$ of countable groups, the STRP locus belongs to ${\boldsymbol \Pi}^0_4$, is ${\boldsymbol \Sigma}^0_3$-hard; the locus of finitely generated virtually free groups is ${\boldsymbol \Sigma}^0_3$-complete. For quotients $F_\omega/N$ with $N$ recursively enumerable, every projectively isolated subshift has decidable finite tuple-language and contains an $N$-recursive configuration. This yields effective SFT obstructions to STRP, including subgroup and direct-product obstructions, and implies that $\mathrm{SL}_n(\mathbb Q)$ does not have \STRP for any $n\geq2$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-20 in math.LO).
Categorie arXiv: Logic (math.LO) ; Dynamical Systems (math.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.18485 — 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-18T13:58:45.836Z dalla pagina https://arxiv.org/catchup/math.LO/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).