Continuous Combinatorics of Abelian Group Actions
Abstract
This paper develops techniques which are used to answer a number of questions in the theory of equivalence relations generated by continuous actions of abelian groups. The methods center around the construction of certain specialized hyper-aperiodic elements, which produce compact subflows with useful properties. For example, we show that there is no continuous -coloring of the Cayley graph on , the free part of the shift action of on . With earlier work of the authors this computes the continuous chromatic number of to be exactly . Combined with marker arguments for the positive directions, our methods allow us to analyze continuous homomorphisms into graphs, and more generally equivariant maps into subshifts of finite type. We present a general construction of a finite set of "tiles" for (there are for ) such that questions about the existence of continuous homomorphisms into various structures reduce to finitary combinatorial questions about the tiles. This tile analysis is used to deduce a number of results about .
Keywords
Cite
@article{arxiv.1803.03872,
title = {Continuous Combinatorics of Abelian Group Actions},
author = {Su Gao and Steve Jackson and Edward Krohne and Brandon Seward},
journal= {arXiv preprint arXiv:1803.03872},
year = {2023}
}
Comments
126 pages, 47 figures