INFINITE STRINGS AND THEIR LARGE SCALE PROPERTIES

• Published in: The Journal of symbolic logic Vol. 87; no. 2; pp. 585 - 625
• Main Authors: KHOUSSAINOV, BAKH, TAKISAKA, TORU
• Format: Journal Article
• Language: English
• Published: New York, USA Cambridge University Press 01.06.2022
• Subjects: 68Q45; quasi-isometry; algorithmic randomness; 68R15; asymptotic cones; Σ03-completeness; 03D05; ultrafilter; 68Q70; Büchi automata; 03D32
• ISSN: 0022-4812; 1943-5886
• DOI: 10.1017/jsl.2020.70

The aim of this paper is to shed light on our understanding of large scale properties of infinite strings. We say that one string $\alpha $ has weaker large scale geometry than that of $\beta $ if there is color preserving bi-Lipschitz map from $\alpha $ into $\beta $ with small distortion. This definition allows us to define a partially ordered set of large scale geometries on the classes of all infinite strings. This partial order compares large scale geometries of infinite strings. As such, it presents an algebraic tool for classification of global patterns. We study properties of this partial order. We prove, for instance, that this partial order has a greatest element and also possess infinite chains and antichains. We also investigate the sets of large scale geometries of strings accepted by finite state machines such as Büchi automata. We provide an algorithm that describes large scale geometries of strings accepted by Büchi automata. This connects the work with the complexity theory. We also prove that the quasi-isometry problem is a $\Sigma _2^0$ -complete set, thus providing a bridge with computability theory. Finally, we build algebraic structures that are invariants of large scale geometries. We invoke asymptotic cones, a key concept in geometric group theory, defined via model-theoretic notion of ultra-product. Partly, we study asymptotic cones of algorithmically random strings, thus connecting the topic with algorithmic randomness.