paper

Strong Topological Rokhlin Property: Finite-Index Ascent, Descriptive Complexity, and Effective Obstructions

arXiv:2608.18485

Abstract

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 has finite index, is finitely generated, and has STRP, then 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 of countable groups, the STRP locus belongs to , is -hard; the locus of finitely generated virtually free groups is -complete. For quotients with recursively enumerable, every projectively isolated subshift has decidable finite tuple-language and contains an -recursive configuration. This yields effective SFT obstructions to STRP, including subgroup and direct-product obstructions, and implies that does not have \STRP for any .

51 pages. Substantially revised version. Improved the descriptive-complexity lower bound from Sigma^0_2-hard to Sigma^0_3-hard, and added results on locally virtually free groups and recursive obstruction theory for countably presented groups

Strong Topological Rokhlin Property: Finite-Index Ascent, Descriptive Complexity, and Effective Obstructions · wovepaper